./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label04.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_overflow.ufo.UNBOUNDED.pals+Problem12_label04.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 935656e2fd7f83fa1197920e6391ee831ebff85c688a5254e91079e29a430b75 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:49:01,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:49:01,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:49:01,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:49:01,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:49:01,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:49:01,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:49:01,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:49:01,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:49:01,292 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:49:01,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:49:01,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:49:01,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:49:01,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:49:01,296 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:49:01,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:49:01,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:49:01,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:49:01,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:49:01,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:49:01,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:49:01,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:49:01,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:49:01,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:49:01,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:49:01,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:49:01,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:49:01,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:49:01,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:49:01,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:49:01,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:49:01,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:49:01,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:49:01,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:49:01,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:49:01,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:49:01,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:49:01,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:49:01,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:49:01,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:49:01,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:49:01,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:49:01,309 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 -> 935656e2fd7f83fa1197920e6391ee831ebff85c688a5254e91079e29a430b75 [2024-11-10 00:49:01,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:49:01,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:49:01,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:49:01,526 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:49:01,527 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:49:01,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:49:02,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:49:03,225 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:49:03,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:49:03,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f377e909/b05319e57c5c43468816d6a90414a2fc/FLAG74dd152b7 [2024-11-10 00:49:03,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f377e909/b05319e57c5c43468816d6a90414a2fc [2024-11-10 00:49:03,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:49:03,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:49:03,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:49:03,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:49:03,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:49:03,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:03" (1/1) ... [2024-11-10 00:49:03,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4f3f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:03, skipping insertion in model container [2024-11-10 00:49:03,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:49:03" (1/1) ... [2024-11-10 00:49:03,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:49:03,617 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_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[6524,6537] [2024-11-10 00:49:03,682 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_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[13585,13598] [2024-11-10 00:49:04,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:49:04,221 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:49:04,247 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_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[6524,6537] [2024-11-10 00:49:04,263 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_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c[13585,13598] [2024-11-10 00:49:04,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:49:04,669 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:49:04,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04 WrapperNode [2024-11-10 00:49:04,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:49:04,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:49:04,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:49:04,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:49:04,684 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:49:04" (1/1) ... [2024-11-10 00:49:04,784 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:49:04" (1/1) ... [2024-11-10 00:49:04,928 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4979 [2024-11-10 00:49:04,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:49:04,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:49:04,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:49:04,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:49:04,937 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (1/1) ... [2024-11-10 00:49:04,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (1/1) ... [2024-11-10 00:49:04,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (1/1) ... [2024-11-10 00:49:05,135 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:49:05,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (1/1) ... [2024-11-10 00:49:05,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (1/1) ... [2024-11-10 00:49:05,304 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (1/1) ... [2024-11-10 00:49:05,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (1/1) ... [2024-11-10 00:49:05,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (1/1) ... [2024-11-10 00:49:05,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (1/1) ... [2024-11-10 00:49:05,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:49:05,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:49:05,385 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:49:05,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:49:05,386 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (1/1) ... [2024-11-10 00:49:05,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:49:05,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:05,415 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:49:05,419 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:49:05,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:49:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:49:05,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:49:05,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:49:05,537 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:49:05,539 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:49:09,588 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc calculate_output_#t~ret29#1; [2024-11-10 00:49:09,589 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465: havoc calculate_output2_#t~ret30#1; [2024-11-10 00:49:09,589 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4955: havoc calculate_output3_#t~ret31#1; [2024-11-10 00:49:09,835 INFO L? ?]: Removed 2071 outVars from TransFormulas that were not future-live. [2024-11-10 00:49:09,836 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:49:09,869 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:49:09,870 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:49:09,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:49:09 BoogieIcfgContainer [2024-11-10 00:49:09,870 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:49:09,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:49:09,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:49:09,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:49:09,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:49:03" (1/3) ... [2024-11-10 00:49:09,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5355ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:49:09, skipping insertion in model container [2024-11-10 00:49:09,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:49:04" (2/3) ... [2024-11-10 00:49:09,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5355ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:49:09, skipping insertion in model container [2024-11-10 00:49:09,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:49:09" (3/3) ... [2024-11-10 00:49:09,877 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label04.c [2024-11-10 00:49:09,891 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:49:09,891 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:49:09,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:49:09,967 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;@619659ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:49:09,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:49:09,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 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:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:49:09,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:09,981 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:49:09,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:09,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash -754437650, now seen corresponding path program 1 times [2024-11-10 00:49:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876869447] [2024-11-10 00:49:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:10,180 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:49:10,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:10,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876869447] [2024-11-10 00:49:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876869447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:10,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:10,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:49:10,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9382219] [2024-11-10 00:49:10,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:10,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:49:10,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:10,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:49:10,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:49:10,213 INFO L87 Difference]: Start difference. First operand has 879 states, 876 states have (on average 2.675799086757991) internal successors, (2344), 878 states have internal predecessors, (2344), 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:49:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:10,278 INFO L93 Difference]: Finished difference Result 1732 states and 4644 transitions. [2024-11-10 00:49:10,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:49:10,283 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:49:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:10,297 INFO L225 Difference]: With dead ends: 1732 [2024-11-10 00:49:10,298 INFO L226 Difference]: Without dead ends: 811 [2024-11-10 00:49:10,303 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:49:10,305 INFO L432 NwaCegarLoop]: 2273 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, 2273 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:49:10,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2273 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-10 00:49:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-10 00:49:10,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 2.7305315203955502) internal successors, (2209), 810 states have internal predecessors, (2209), 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:10,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2209 transitions. [2024-11-10 00:49:10,371 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2209 transitions. Word has length 22 [2024-11-10 00:49:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:10,371 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 2209 transitions. [2024-11-10 00:49:10,372 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:49:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2209 transitions. [2024-11-10 00:49:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:49:10,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:10,373 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:49:10,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:49:10,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:10,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:10,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1264971827, now seen corresponding path program 1 times [2024-11-10 00:49:10,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:10,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893876272] [2024-11-10 00:49:10,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:10,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:10,526 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:49:10,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:10,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893876272] [2024-11-10 00:49:10,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893876272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:10,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:10,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:10,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223495367] [2024-11-10 00:49:10,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:10,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:10,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:10,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:10,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:10,529 INFO L87 Difference]: Start difference. First operand 811 states and 2209 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:49:10,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:10,660 INFO L93 Difference]: Finished difference Result 848 states and 2263 transitions. [2024-11-10 00:49:10,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:10,661 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:49:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:10,666 INFO L225 Difference]: With dead ends: 848 [2024-11-10 00:49:10,666 INFO L226 Difference]: Without dead ends: 811 [2024-11-10 00:49:10,667 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:49:10,668 INFO L432 NwaCegarLoop]: 2207 mSDtfsCounter, 0 mSDsluCounter, 6600 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8807 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:10,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8807 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:49:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-10 00:49:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-10 00:49:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 2.710754017305315) internal successors, (2193), 810 states have internal predecessors, (2193), 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:10,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 2193 transitions. [2024-11-10 00:49:10,696 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 2193 transitions. Word has length 22 [2024-11-10 00:49:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:10,696 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 2193 transitions. [2024-11-10 00:49:10,697 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:49:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 2193 transitions. [2024-11-10 00:49:10,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 00:49:10,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:10,698 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:49:10,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:49:10,699 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:10,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:10,700 INFO L85 PathProgramCache]: Analyzing trace with hash 606557701, now seen corresponding path program 1 times [2024-11-10 00:49:10,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:10,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904579310] [2024-11-10 00:49:10,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:10,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:10,799 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:49:10,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904579310] [2024-11-10 00:49:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904579310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:10,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:10,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761123242] [2024-11-10 00:49:10,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:10,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:10,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:10,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:10,802 INFO L87 Difference]: Start difference. First operand 811 states and 2193 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:49:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:10,909 INFO L93 Difference]: Finished difference Result 1009 states and 2493 transitions. [2024-11-10 00:49:10,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:49:10,909 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:49:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:10,913 INFO L225 Difference]: With dead ends: 1009 [2024-11-10 00:49:10,913 INFO L226 Difference]: Without dead ends: 976 [2024-11-10 00:49:10,914 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:49:10,915 INFO L432 NwaCegarLoop]: 2189 mSDtfsCounter, 6651 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6651 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:10,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6651 Valid, 2577 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-10 00:49:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 841. [2024-11-10 00:49:10,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 2.66865315852205) internal successors, (2239), 840 states have internal predecessors, (2239), 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:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2239 transitions. [2024-11-10 00:49:10,933 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2239 transitions. Word has length 37 [2024-11-10 00:49:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:10,933 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 2239 transitions. [2024-11-10 00:49:10,933 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:49:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2239 transitions. [2024-11-10 00:49:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 00:49:10,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:10,935 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:49:10,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:49:10,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:10,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:10,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1075758951, now seen corresponding path program 1 times [2024-11-10 00:49:10,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:10,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347779568] [2024-11-10 00:49:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:10,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:11,060 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:49:11,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:11,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347779568] [2024-11-10 00:49:11,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347779568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:11,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:11,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:11,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499992830] [2024-11-10 00:49:11,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:11,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:11,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:11,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:11,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:11,062 INFO L87 Difference]: Start difference. First operand 841 states and 2239 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:49:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:11,122 INFO L93 Difference]: Finished difference Result 907 states and 2337 transitions. [2024-11-10 00:49:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:11,123 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:49:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:11,126 INFO L225 Difference]: With dead ends: 907 [2024-11-10 00:49:11,126 INFO L226 Difference]: Without dead ends: 844 [2024-11-10 00:49:11,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:49:11,127 INFO L432 NwaCegarLoop]: 2188 mSDtfsCounter, 6469 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6469 SdHoareTripleChecker+Valid, 2280 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:49:11,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6469 Valid, 2280 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-10 00:49:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 841. [2024-11-10 00:49:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 2.66746126340882) internal successors, (2238), 840 states have internal predecessors, (2238), 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:11,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2238 transitions. [2024-11-10 00:49:11,139 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2238 transitions. Word has length 39 [2024-11-10 00:49:11,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:11,139 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 2238 transitions. [2024-11-10 00:49:11,140 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:49:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2238 transitions. [2024-11-10 00:49:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 00:49:11,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:11,141 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:49:11,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:49:11,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:11,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash 712608318, now seen corresponding path program 1 times [2024-11-10 00:49:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:11,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579764271] [2024-11-10 00:49:11,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:11,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:11,252 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:49:11,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:11,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579764271] [2024-11-10 00:49:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579764271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635123488] [2024-11-10 00:49:11,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:11,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:11,255 INFO L87 Difference]: Start difference. First operand 841 states and 2238 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:49:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:11,278 INFO L93 Difference]: Finished difference Result 955 states and 2408 transitions. [2024-11-10 00:49:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:11,279 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:49:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:11,282 INFO L225 Difference]: With dead ends: 955 [2024-11-10 00:49:11,282 INFO L226 Difference]: Without dead ends: 892 [2024-11-10 00:49:11,283 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:49:11,283 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 2150 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2150 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:11,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2150 Valid, 2244 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:11,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-11-10 00:49:11,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2024-11-10 00:49:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 887 states have (on average 2.602029312288613) internal successors, (2308), 888 states have internal predecessors, (2308), 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:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 2308 transitions. [2024-11-10 00:49:11,298 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 2308 transitions. Word has length 40 [2024-11-10 00:49:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:11,298 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 2308 transitions. [2024-11-10 00:49:11,298 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:49:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 2308 transitions. [2024-11-10 00:49:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:49:11,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:11,299 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:49:11,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:49:11,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:11,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash 55525097, now seen corresponding path program 1 times [2024-11-10 00:49:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224572059] [2024-11-10 00:49:11,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:11,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:11,338 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:49:11,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:11,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224572059] [2024-11-10 00:49:11,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224572059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:11,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:11,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:11,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103653096] [2024-11-10 00:49:11,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:11,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:11,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:11,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:11,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:11,341 INFO L87 Difference]: Start difference. First operand 889 states and 2308 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:49:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:11,360 INFO L93 Difference]: Finished difference Result 1010 states and 2488 transitions. [2024-11-10 00:49:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:11,362 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:49:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:11,365 INFO L225 Difference]: With dead ends: 1010 [2024-11-10 00:49:11,365 INFO L226 Difference]: Without dead ends: 947 [2024-11-10 00:49:11,366 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:49:11,366 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2160 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2278 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:49:11,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2278 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:11,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-10 00:49:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 944. [2024-11-10 00:49:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 942 states have (on average 2.535031847133758) internal successors, (2388), 943 states have internal predecessors, (2388), 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:11,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 2388 transitions. [2024-11-10 00:49:11,381 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 2388 transitions. Word has length 41 [2024-11-10 00:49:11,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:11,381 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 2388 transitions. [2024-11-10 00:49:11,381 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:49:11,381 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 2388 transitions. [2024-11-10 00:49:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:49:11,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:11,382 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:49:11,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:49:11,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:11,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:11,383 INFO L85 PathProgramCache]: Analyzing trace with hash 41075241, now seen corresponding path program 1 times [2024-11-10 00:49:11,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:11,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942440252] [2024-11-10 00:49:11,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:11,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:11,415 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:49:11,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:11,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942440252] [2024-11-10 00:49:11,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942440252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:11,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:11,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:11,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474489300] [2024-11-10 00:49:11,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:11,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:11,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:11,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:11,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:11,417 INFO L87 Difference]: Start difference. First operand 944 states and 2388 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:49:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:11,439 INFO L93 Difference]: Finished difference Result 1246 states and 2830 transitions. [2024-11-10 00:49:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:11,439 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:49:11,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:11,443 INFO L225 Difference]: With dead ends: 1246 [2024-11-10 00:49:11,443 INFO L226 Difference]: Without dead ends: 1083 [2024-11-10 00:49:11,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:49:11,444 INFO L432 NwaCegarLoop]: 2229 mSDtfsCounter, 2158 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2158 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:49:11,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2158 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:49:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-10 00:49:11,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1080. [2024-11-10 00:49:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1078 states have (on average 2.3933209647495364) internal successors, (2580), 1079 states have internal predecessors, (2580), 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:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 2580 transitions. [2024-11-10 00:49:11,460 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 2580 transitions. Word has length 41 [2024-11-10 00:49:11,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:11,460 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 2580 transitions. [2024-11-10 00:49:11,461 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:49:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 2580 transitions. [2024-11-10 00:49:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:49:11,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:11,461 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:49:11,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:49:11,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:11,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2132677993, now seen corresponding path program 1 times [2024-11-10 00:49:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:11,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703260247] [2024-11-10 00:49:11,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:11,497 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:49:11,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:11,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703260247] [2024-11-10 00:49:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703260247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:11,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:11,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:11,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559951816] [2024-11-10 00:49:11,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:11,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:11,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:11,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:11,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:11,499 INFO L87 Difference]: Start difference. First operand 1080 states and 2580 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:49:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:11,524 INFO L93 Difference]: Finished difference Result 1630 states and 3364 transitions. [2024-11-10 00:49:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:11,525 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:49:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:11,529 INFO L225 Difference]: With dead ends: 1630 [2024-11-10 00:49:11,529 INFO L226 Difference]: Without dead ends: 1331 [2024-11-10 00:49:11,529 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:49:11,530 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 2156 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 2286 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:49:11,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 2286 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-10 00:49:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1328. [2024-11-10 00:49:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 2.1990950226244346) internal successors, (2916), 1327 states have internal predecessors, (2916), 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:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2916 transitions. [2024-11-10 00:49:11,549 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2916 transitions. Word has length 41 [2024-11-10 00:49:11,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:11,549 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2916 transitions. [2024-11-10 00:49:11,549 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:49:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2916 transitions. [2024-11-10 00:49:11,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:49:11,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:11,550 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:49:11,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:49:11,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:11,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:11,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1608400938, now seen corresponding path program 1 times [2024-11-10 00:49:11,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:11,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563740844] [2024-11-10 00:49:11,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:11,654 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:49:11,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:11,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563740844] [2024-11-10 00:49:11,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563740844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:11,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:11,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:11,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13974411] [2024-11-10 00:49:11,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:11,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:11,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:11,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:11,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:11,656 INFO L87 Difference]: Start difference. First operand 1328 states and 2916 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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:49:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:11,699 INFO L93 Difference]: Finished difference Result 1379 states and 2982 transitions. [2024-11-10 00:49:11,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:11,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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:49:11,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:11,704 INFO L225 Difference]: With dead ends: 1379 [2024-11-10 00:49:11,704 INFO L226 Difference]: Without dead ends: 1376 [2024-11-10 00:49:11,704 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:49:11,705 INFO L432 NwaCegarLoop]: 2190 mSDtfsCounter, 0 mSDsluCounter, 6561 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8751 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:11,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8751 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-10 00:49:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2024-11-10 00:49:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1374 states have (on average 2.1542940320232895) internal successors, (2960), 1375 states have internal predecessors, (2960), 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:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2960 transitions. [2024-11-10 00:49:11,724 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2960 transitions. Word has length 41 [2024-11-10 00:49:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:11,725 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2960 transitions. [2024-11-10 00:49:11,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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:49:11,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2960 transitions. [2024-11-10 00:49:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:49:11,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:11,726 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:49:11,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:49:11,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:11,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:11,726 INFO L85 PathProgramCache]: Analyzing trace with hash 18026415, now seen corresponding path program 1 times [2024-11-10 00:49:11,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:11,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158989176] [2024-11-10 00:49:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:11,810 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:49:11,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:11,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158989176] [2024-11-10 00:49:11,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158989176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:11,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:11,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159026457] [2024-11-10 00:49:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:11,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:11,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:11,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:11,812 INFO L87 Difference]: Start difference. First operand 1376 states and 2960 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:11,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:11,904 INFO L93 Difference]: Finished difference Result 3144 states and 5372 transitions. [2024-11-10 00:49:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:49:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:11,913 INFO L225 Difference]: With dead ends: 3144 [2024-11-10 00:49:11,913 INFO L226 Difference]: Without dead ends: 2709 [2024-11-10 00:49:11,914 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:49:11,914 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 4410 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4410 SdHoareTripleChecker+Valid, 4555 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:11,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4410 Valid, 4555 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2024-11-10 00:49:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 1892. [2024-11-10 00:49:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1890 states have (on average 1.9343915343915343) internal successors, (3656), 1891 states have internal predecessors, (3656), 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:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 3656 transitions. [2024-11-10 00:49:11,950 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 3656 transitions. Word has length 58 [2024-11-10 00:49:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:11,950 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 3656 transitions. [2024-11-10 00:49:11,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 3656 transitions. [2024-11-10 00:49:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:49:11,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:11,951 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:49:11,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:49:11,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:11,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:11,952 INFO L85 PathProgramCache]: Analyzing trace with hash 3576559, now seen corresponding path program 1 times [2024-11-10 00:49:11,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:11,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852914868] [2024-11-10 00:49:11,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:11,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:12,023 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:49:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:12,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852914868] [2024-11-10 00:49:12,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852914868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:12,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:12,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:12,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127786606] [2024-11-10 00:49:12,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:12,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:12,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:12,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:12,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:12,025 INFO L87 Difference]: Start difference. First operand 1892 states and 3656 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:49:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:12,114 INFO L93 Difference]: Finished difference Result 3736 states and 6176 transitions. [2024-11-10 00:49:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:12,115 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:49:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:12,123 INFO L225 Difference]: With dead ends: 3736 [2024-11-10 00:49:12,123 INFO L226 Difference]: Without dead ends: 3141 [2024-11-10 00:49:12,125 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:49:12,125 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 4414 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4414 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:12,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4414 Valid, 4528 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-11-10 00:49:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2700. [2024-11-10 00:49:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2698 states have (on average 1.7583395107487028) internal successors, (4744), 2699 states have internal predecessors, (4744), 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:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 4744 transitions. [2024-11-10 00:49:12,174 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 4744 transitions. Word has length 58 [2024-11-10 00:49:12,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:12,175 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 4744 transitions. [2024-11-10 00:49:12,175 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:49:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 4744 transitions. [2024-11-10 00:49:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:49:12,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:12,176 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:49:12,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:49:12,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:12,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:12,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2095179311, now seen corresponding path program 1 times [2024-11-10 00:49:12,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:12,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185858401] [2024-11-10 00:49:12,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:12,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:12,241 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:49:12,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185858401] [2024-11-10 00:49:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185858401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:12,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:12,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:49:12,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678666966] [2024-11-10 00:49:12,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:12,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:49:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:49:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:49:12,242 INFO L87 Difference]: Start difference. First operand 2700 states and 4744 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:49:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:12,388 INFO L93 Difference]: Finished difference Result 4328 states and 6976 transitions. [2024-11-10 00:49:12,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:49:12,389 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:49:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:12,397 INFO L225 Difference]: With dead ends: 4328 [2024-11-10 00:49:12,398 INFO L226 Difference]: Without dead ends: 3733 [2024-11-10 00:49:12,399 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:49:12,399 INFO L432 NwaCegarLoop]: 2237 mSDtfsCounter, 4421 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4421 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:12,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4421 Valid, 4538 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2024-11-10 00:49:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3292. [2024-11-10 00:49:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3290 states have (on average 1.6851063829787234) internal successors, (5544), 3291 states have internal predecessors, (5544), 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:12,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5544 transitions. [2024-11-10 00:49:12,462 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5544 transitions. Word has length 58 [2024-11-10 00:49:12,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:12,462 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 5544 transitions. [2024-11-10 00:49:12,463 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:49:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5544 transitions. [2024-11-10 00:49:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:49:12,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:12,464 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:49:12,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:49:12,464 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:12,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1862091119, now seen corresponding path program 1 times [2024-11-10 00:49:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:12,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47384170] [2024-11-10 00:49:12,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:12,528 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:49:12,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:12,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47384170] [2024-11-10 00:49:12,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47384170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:12,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:12,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:12,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550354903] [2024-11-10 00:49:12,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:12,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:12,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:12,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:12,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:12,529 INFO L87 Difference]: Start difference. First operand 3292 states and 5544 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:49:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:12,584 INFO L93 Difference]: Finished difference Result 5806 states and 8944 transitions. [2024-11-10 00:49:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:12,584 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:49:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:12,600 INFO L225 Difference]: With dead ends: 5806 [2024-11-10 00:49:12,601 INFO L226 Difference]: Without dead ends: 3295 [2024-11-10 00:49:12,606 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:49:12,608 INFO L432 NwaCegarLoop]: 2213 mSDtfsCounter, 28 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4394 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:49:12,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4394 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2024-11-10 00:49:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3292. [2024-11-10 00:49:12,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3290 states have (on average 1.6699088145896657) internal successors, (5494), 3291 states have internal predecessors, (5494), 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:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 5494 transitions. [2024-11-10 00:49:12,710 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 5494 transitions. Word has length 60 [2024-11-10 00:49:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:12,710 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 5494 transitions. [2024-11-10 00:49:12,711 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:49:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 5494 transitions. [2024-11-10 00:49:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:49:12,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:12,712 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:49:12,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:49:12,712 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:12,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:12,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1431466449, now seen corresponding path program 1 times [2024-11-10 00:49:12,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:12,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723744813] [2024-11-10 00:49:12,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:12,805 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:49:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:12,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723744813] [2024-11-10 00:49:12,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723744813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:12,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:12,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093134632] [2024-11-10 00:49:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:12,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:12,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:12,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:12,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:12,807 INFO L87 Difference]: Start difference. First operand 3292 states and 5494 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:49:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:12,835 INFO L93 Difference]: Finished difference Result 4287 states and 6830 transitions. [2024-11-10 00:49:12,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:12,835 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:49:12,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:12,842 INFO L225 Difference]: With dead ends: 4287 [2024-11-10 00:49:12,842 INFO L226 Difference]: Without dead ends: 1776 [2024-11-10 00:49:12,845 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:49:12,845 INFO L432 NwaCegarLoop]: 2211 mSDtfsCounter, 24 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4391 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:49:12,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4391 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-10 00:49:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1766. [2024-11-10 00:49:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.9580498866213152) internal successors, (3454), 1765 states have internal predecessors, (3454), 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:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 3454 transitions. [2024-11-10 00:49:12,880 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 3454 transitions. Word has length 60 [2024-11-10 00:49:12,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:12,880 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 3454 transitions. [2024-11-10 00:49:12,880 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:49:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 3454 transitions. [2024-11-10 00:49:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:49:12,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:12,882 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] [2024-11-10 00:49:12,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:49:12,882 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:12,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1439328557, now seen corresponding path program 1 times [2024-11-10 00:49:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:12,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286599584] [2024-11-10 00:49:12,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:12,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:12,946 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:49:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286599584] [2024-11-10 00:49:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286599584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:12,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928720240] [2024-11-10 00:49:12,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:12,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:49:12,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:12,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:49:12,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:49:12,948 INFO L87 Difference]: Start difference. First operand 1766 states and 3454 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:49:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:12,969 INFO L93 Difference]: Finished difference Result 2258 states and 4106 transitions. [2024-11-10 00:49:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:49:12,969 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:49:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:12,972 INFO L225 Difference]: With dead ends: 2258 [2024-11-10 00:49:12,972 INFO L226 Difference]: Without dead ends: 1283 [2024-11-10 00:49:12,973 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:49:12,973 INFO L432 NwaCegarLoop]: 2205 mSDtfsCounter, 22 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4370 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:49:12,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4370 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:49:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-11-10 00:49:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1280. [2024-11-10 00:49:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1278 states have (on average 2.1885758998435056) internal successors, (2797), 1279 states have internal predecessors, (2797), 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:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2797 transitions. [2024-11-10 00:49:12,990 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2797 transitions. Word has length 62 [2024-11-10 00:49:12,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:12,991 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 2797 transitions. [2024-11-10 00:49:12,991 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:49:12,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2797 transitions. [2024-11-10 00:49:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-10 00:49:12,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:12,992 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, 1] [2024-11-10 00:49:12,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:49:12,992 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:12,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:12,992 INFO L85 PathProgramCache]: Analyzing trace with hash -588989900, now seen corresponding path program 1 times [2024-11-10 00:49:12,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:12,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700604920] [2024-11-10 00:49:12,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:12,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:13,071 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:49:13,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:13,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700604920] [2024-11-10 00:49:13,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700604920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:49:13,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:49:13,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:49:13,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774305067] [2024-11-10 00:49:13,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:49:13,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:49:13,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:13,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:49:13,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:49:13,073 INFO L87 Difference]: Start difference. First operand 1280 states and 2797 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:20,395 INFO L93 Difference]: Finished difference Result 3539 states and 9150 transitions. [2024-11-10 00:49:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:49:20,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2024-11-10 00:49:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:20,400 INFO L225 Difference]: With dead ends: 3539 [2024-11-10 00:49:20,401 INFO L226 Difference]: Without dead ends: 2784 [2024-11-10 00:49:20,402 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:49:20,402 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 4383 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4383 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:20,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4383 Valid, 790 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-10 00:49:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2024-11-10 00:49:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2784. [2024-11-10 00:49:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2784 states, 2782 states have (on average 2.205248023005032) internal successors, (6135), 2783 states have internal predecessors, (6135), 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:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 6135 transitions. [2024-11-10 00:49:20,454 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 6135 transitions. Word has length 63 [2024-11-10 00:49:20,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:20,454 INFO L471 AbstractCegarLoop]: Abstraction has 2784 states and 6135 transitions. [2024-11-10 00:49:20,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 6135 transitions. [2024-11-10 00:49:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:49:20,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:20,455 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] [2024-11-10 00:49:20,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 00:49:20,455 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:20,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash 111390330, now seen corresponding path program 1 times [2024-11-10 00:49:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:20,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898950019] [2024-11-10 00:49:20,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:20,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:20,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:49:20,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:20,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898950019] [2024-11-10 00:49:20,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898950019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:20,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520796432] [2024-11-10 00:49:20,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:20,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:20,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:20,813 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:49:20,820 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:49:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:20,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 00:49:20,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:23,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:26,933 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:26,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520796432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:26,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:26,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 20] total 42 [2024-11-10 00:49:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228972530] [2024-11-10 00:49:26,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:26,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:49:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:49:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1425, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:49:26,936 INFO L87 Difference]: Start difference. First operand 2784 states and 6135 transitions. Second operand has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 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:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:49:38,415 INFO L93 Difference]: Finished difference Result 7315 states and 12023 transitions. [2024-11-10 00:49:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-10 00:49:38,416 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 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:49:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:49:38,427 INFO L225 Difference]: With dead ends: 7315 [2024-11-10 00:49:38,427 INFO L226 Difference]: Without dead ends: 6826 [2024-11-10 00:49:38,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4365 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=3014, Invalid=10326, Unknown=0, NotChecked=0, Total=13340 [2024-11-10 00:49:38,433 INFO L432 NwaCegarLoop]: 2171 mSDtfsCounter, 30892 mSDsluCounter, 20156 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30892 SdHoareTripleChecker+Valid, 22327 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:49:38,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30892 Valid, 22327 Invalid, 1169 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [87 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 00:49:38,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6826 states. [2024-11-10 00:49:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6826 to 4210. [2024-11-10 00:49:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4208 states have (on average 1.893773764258555) internal successors, (7969), 4209 states have internal predecessors, (7969), 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:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 7969 transitions. [2024-11-10 00:49:38,529 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 7969 transitions. Word has length 64 [2024-11-10 00:49:38,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:49:38,530 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 7969 transitions. [2024-11-10 00:49:38,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 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:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 7969 transitions. [2024-11-10 00:49:38,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:49:38,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:49:38,531 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] [2024-11-10 00:49:38,549 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:49:38,732 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:49:38,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:49:38,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:49:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1426733626, now seen corresponding path program 1 times [2024-11-10 00:49:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:49:38,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501318722] [2024-11-10 00:49:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:38,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:49:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:39,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:49:39,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:49:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501318722] [2024-11-10 00:49:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501318722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:49:39,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115990471] [2024-11-10 00:49:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:49:39,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:49:39,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:49:39,166 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:49:39,167 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:49:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:49:39,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 00:49:39,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:49:41,943 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:49:41,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:49:43,658 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:43,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115990471] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:49:43,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:49:43,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 42 [2024-11-10 00:49:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712155848] [2024-11-10 00:49:43,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:49:43,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-10 00:49:43,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:49:43,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-10 00:49:43,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1528, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 00:49:43,660 INFO L87 Difference]: Start difference. First operand 4210 states and 7969 transitions. Second operand has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 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:50:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:08,453 INFO L93 Difference]: Finished difference Result 12188 states and 18368 transitions. [2024-11-10 00:50:08,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2024-11-10 00:50:08,453 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 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:50:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:08,469 INFO L225 Difference]: With dead ends: 12188 [2024-11-10 00:50:08,469 INFO L226 Difference]: Without dead ends: 10273 [2024-11-10 00:50:08,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12297 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=5886, Invalid=26694, Unknown=0, NotChecked=0, Total=32580 [2024-11-10 00:50:08,478 INFO L432 NwaCegarLoop]: 2256 mSDtfsCounter, 23880 mSDsluCounter, 30699 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23880 SdHoareTripleChecker+Valid, 32955 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:08,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23880 Valid, 32955 Invalid, 2967 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [98 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 00:50:08,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10273 states. [2024-11-10 00:50:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10273 to 7378. [2024-11-10 00:50:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7376 states have (on average 1.636795010845987) internal successors, (12073), 7377 states have internal predecessors, (12073), 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:50:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 12073 transitions. [2024-11-10 00:50:08,753 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 12073 transitions. Word has length 64 [2024-11-10 00:50:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:08,754 INFO L471 AbstractCegarLoop]: Abstraction has 7378 states and 12073 transitions. [2024-11-10 00:50:08,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0) internal successors, (168), 42 states have internal predecessors, (168), 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:50:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 12073 transitions. [2024-11-10 00:50:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:50:08,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:08,757 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:50:08,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 00:50:08,957 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:50:08,958 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:08,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1274102374, now seen corresponding path program 1 times [2024-11-10 00:50:08,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744320142] [2024-11-10 00:50:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:09,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744320142] [2024-11-10 00:50:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744320142] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:09,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247504938] [2024-11-10 00:50:09,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:09,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:09,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:09,804 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:50:09,805 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:50:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:09,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 00:50:09,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:50:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:10,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:50:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247504938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:50:10,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:50:10,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 6] total 28 [2024-11-10 00:50:10,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153086708] [2024-11-10 00:50:10,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:50:10,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 00:50:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:10,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 00:50:10,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2024-11-10 00:50:10,336 INFO L87 Difference]: Start difference. First operand 7378 states and 12073 transitions. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 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:50:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:21,924 INFO L93 Difference]: Finished difference Result 25078 states and 34546 transitions. [2024-11-10 00:50:21,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-11-10 00:50:21,924 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 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:50:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:21,947 INFO L225 Difference]: With dead ends: 25078 [2024-11-10 00:50:21,947 INFO L226 Difference]: Without dead ends: 19707 [2024-11-10 00:50:21,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9860 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=4314, Invalid=22092, Unknown=0, NotChecked=0, Total=26406 [2024-11-10 00:50:21,958 INFO L432 NwaCegarLoop]: 2302 mSDtfsCounter, 28026 mSDsluCounter, 25585 mSDsCounter, 0 mSdLazyCounter, 4084 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28026 SdHoareTripleChecker+Valid, 27887 SdHoareTripleChecker+Invalid, 4188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 4084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:21,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28026 Valid, 27887 Invalid, 4188 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [104 Valid, 4084 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 00:50:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19707 states. [2024-11-10 00:50:22,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19707 to 13602. [2024-11-10 00:50:22,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13602 states, 13600 states have (on average 1.4358823529411764) internal successors, (19528), 13601 states have internal predecessors, (19528), 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:50:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13602 states to 13602 states and 19528 transitions. [2024-11-10 00:50:22,618 INFO L78 Accepts]: Start accepts. Automaton has 13602 states and 19528 transitions. Word has length 67 [2024-11-10 00:50:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:22,618 INFO L471 AbstractCegarLoop]: Abstraction has 13602 states and 19528 transitions. [2024-11-10 00:50:22,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 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:50:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 13602 states and 19528 transitions. [2024-11-10 00:50:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:50:22,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:22,621 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 00:50:22,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 00:50:22,822 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:50:22,823 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:22,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:22,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1193218968, now seen corresponding path program 1 times [2024-11-10 00:50:22,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:22,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057882172] [2024-11-10 00:50:22,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:22,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 16 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:23,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:23,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057882172] [2024-11-10 00:50:23,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057882172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:23,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064067138] [2024-11-10 00:50:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:23,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:23,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:23,402 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:50:23,406 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:50:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:23,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 00:50:23,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:50:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 44 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:24,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:50:26,001 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 34 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:26,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064067138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:50:26,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:50:26,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2024-11-10 00:50:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46727164] [2024-11-10 00:50:26,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:50:26,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 00:50:26,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:26,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 00:50:26,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 00:50:26,004 INFO L87 Difference]: Start difference. First operand 13602 states and 19528 transitions. Second operand has 33 states, 33 states have (on average 8.909090909090908) internal successors, (294), 33 states have internal predecessors, (294), 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:50:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:50:31,378 INFO L93 Difference]: Finished difference Result 30433 states and 40384 transitions. [2024-11-10 00:50:31,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-11-10 00:50:31,379 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 8.909090909090908) internal successors, (294), 33 states have internal predecessors, (294), 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 108 [2024-11-10 00:50:31,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:50:31,428 INFO L225 Difference]: With dead ends: 30433 [2024-11-10 00:50:31,432 INFO L226 Difference]: Without dead ends: 20189 [2024-11-10 00:50:31,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2526 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2034, Invalid=8472, Unknown=0, NotChecked=0, Total=10506 [2024-11-10 00:50:31,458 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 24794 mSDsluCounter, 29217 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24794 SdHoareTripleChecker+Valid, 31444 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 00:50:31,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24794 Valid, 31444 Invalid, 1532 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 00:50:31,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20189 states. [2024-11-10 00:50:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20189 to 8912. [2024-11-10 00:50:32,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8912 states, 8910 states have (on average 1.5185185185185186) internal successors, (13530), 8911 states have internal predecessors, (13530), 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:50:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8912 states to 8912 states and 13530 transitions. [2024-11-10 00:50:32,127 INFO L78 Accepts]: Start accepts. Automaton has 8912 states and 13530 transitions. Word has length 108 [2024-11-10 00:50:32,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:50:32,127 INFO L471 AbstractCegarLoop]: Abstraction has 8912 states and 13530 transitions. [2024-11-10 00:50:32,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.909090909090908) internal successors, (294), 33 states have internal predecessors, (294), 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:50:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states and 13530 transitions. [2024-11-10 00:50:32,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 00:50:32,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:50:32,130 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 00:50:32,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 00:50:32,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:32,334 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:50:32,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:50:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1447178297, now seen corresponding path program 1 times [2024-11-10 00:50:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:50:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938110753] [2024-11-10 00:50:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:50:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 25 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:33,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:50:33,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938110753] [2024-11-10 00:50:33,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938110753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:50:33,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278220325] [2024-11-10 00:50:33,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:50:33,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:50:33,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:50:33,263 INFO L229 MonitoredProcess]: Starting monitored process 6 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:50:33,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 00:50:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:50:33,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 00:50:33,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:50:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 21 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:34,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:50:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 17 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:50:35,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278220325] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:50:35,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:50:35,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 36 [2024-11-10 00:50:35,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408275836] [2024-11-10 00:50:35,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:50:35,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-10 00:50:35,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:50:35,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-10 00:50:35,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 00:50:35,207 INFO L87 Difference]: Start difference. First operand 8912 states and 13530 transitions. Second operand has 36 states, 36 states have (on average 8.194444444444445) internal successors, (295), 36 states have internal predecessors, (295), 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)