./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.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 b7385fd88a67a4d51b868c33a4a2a17411348aca1f3bf817148857f9693eef2c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:08:42,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:08:42,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:08:42,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:08:42,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:08:42,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:08:42,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:08:42,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:08:42,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:08:42,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:08:42,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:08:42,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:08:42,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:08:42,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:08:42,926 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:08:42,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:08:42,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:08:42,928 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:08:42,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:08:42,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:08:42,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:08:42,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:08:42,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:08:42,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:08:42,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:08:42,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:08:42,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:08:42,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:08:42,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:08:42,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:08:42,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:08:42,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:08:42,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:08:42,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:08:42,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:08:42,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:08:42,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:08:42,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:08:42,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:08:42,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:08:42,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:08:42,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:08:42,936 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 -> b7385fd88a67a4d51b868c33a4a2a17411348aca1f3bf817148857f9693eef2c [2024-10-12 16:08:43,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:08:43,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:08:43,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:08:43,250 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:08:43,251 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:08:43,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c [2024-10-12 16:08:44,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:08:45,134 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:08:45,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c [2024-10-12 16:08:45,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec406da60/5208454809ef44d28d70d855713de1f9/FLAG9faa76cbc [2024-10-12 16:08:45,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec406da60/5208454809ef44d28d70d855713de1f9 [2024-10-12 16:08:45,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:08:45,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:08:45,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:08:45,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:08:45,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:08:45,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:08:45" (1/1) ... [2024-10-12 16:08:45,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b333dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:45, skipping insertion in model container [2024-10-12 16:08:45,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:08:45" (1/1) ... [2024-10-12 16:08:45,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:08:45,667 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c[8099,8112] [2024-10-12 16:08:46,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:08:46,413 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:08:46,443 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c[8099,8112] [2024-10-12 16:08:46,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:08:46,922 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:08:46,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46 WrapperNode [2024-10-12 16:08:46,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:08:46,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:08:46,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:08:46,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:08:46,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:47,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:47,440 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-12 16:08:47,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:08:47,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:08:47,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:08:47,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:08:47,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:47,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:47,713 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:48,015 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-10-12 16:08:48,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:48,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:48,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:48,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:48,383 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:48,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:48,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:08:48,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:08:48,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:08:48,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:08:48,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (1/1) ... [2024-10-12 16:08:48,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:08:48,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:08:48,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:08:48,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:08:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:08:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:08:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:08:48,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:08:48,670 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:08:48,672 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:08:54,797 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-12 16:08:54,797 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:08:54,872 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:08:54,872 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:08:54,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:08:54 BoogieIcfgContainer [2024-10-12 16:08:54,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:08:54,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:08:54,875 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:08:54,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:08:54,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:08:45" (1/3) ... [2024-10-12 16:08:54,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202cb0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:08:54, skipping insertion in model container [2024-10-12 16:08:54,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:46" (2/3) ... [2024-10-12 16:08:54,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202cb0e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:08:54, skipping insertion in model container [2024-10-12 16:08:54,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:08:54" (3/3) ... [2024-10-12 16:08:54,881 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label13.c [2024-10-12 16:08:54,897 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:08:54,898 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:08:54,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:08:54,993 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;@6e25fed7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:08:54,993 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:08:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 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-10-12 16:08:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 16:08:55,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:08:55,012 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] [2024-10-12 16:08:55,013 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:08:55,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:08:55,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1341323251, now seen corresponding path program 1 times [2024-10-12 16:08:55,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:08:55,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571898395] [2024-10-12 16:08:55,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:08:55,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:08:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:08:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:08:55,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:08:55,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571898395] [2024-10-12 16:08:55,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571898395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:08:55,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:08:55,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:08:55,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733748161] [2024-10-12 16:08:55,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:08:55,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:08:55,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:08:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:08:55,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:08:55,288 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 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 28.0) internal successors, (56), 2 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-10-12 16:08:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:08:55,401 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-12 16:08:55,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:08:55,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 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 56 [2024-10-12 16:08:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:08:55,431 INFO L225 Difference]: With dead ends: 2071 [2024-10-12 16:08:55,432 INFO L226 Difference]: Without dead ends: 1034 [2024-10-12 16:08:55,441 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-10-12 16:08:55,445 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:08:55,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:08:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-12 16:08:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-12 16:08:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 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-10-12 16:08:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-12 16:08:55,541 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 56 [2024-10-12 16:08:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:08:55,541 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-12 16:08:55,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 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-10-12 16:08:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-12 16:08:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 16:08:55,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:08:55,543 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] [2024-10-12 16:08:55,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:08:55,544 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:08:55,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:08:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash 512037456, now seen corresponding path program 1 times [2024-10-12 16:08:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:08:55,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672495455] [2024-10-12 16:08:55,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:08:55,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:08:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:08:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:08:55,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:08:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672495455] [2024-10-12 16:08:55,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672495455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:08:55,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:08:55,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:08:55,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953040526] [2024-10-12 16:08:55,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:08:55,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:08:55,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:08:55,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:08:55,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:08:55,980 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 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-10-12 16:09:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:01,918 INFO L93 Difference]: Finished difference Result 3696 states and 6823 transitions. [2024-10-12 16:09:01,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:09:01,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 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 56 [2024-10-12 16:09:01,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:01,933 INFO L225 Difference]: With dead ends: 3696 [2024-10-12 16:09:01,934 INFO L226 Difference]: Without dead ends: 2663 [2024-10-12 16:09:01,938 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-10-12 16:09:01,940 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 2648 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 4127 mSolverCounterSat, 1487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2648 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 5614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1487 IncrementalHoareTripleChecker+Valid, 4127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:01,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2648 Valid, 1017 Invalid, 5614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1487 Valid, 4127 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-12 16:09:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-10-12 16:09:01,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2662. [2024-10-12 16:09:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.4611048478015785) internal successors, (3888), 2661 states have internal predecessors, (3888), 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-10-12 16:09:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3888 transitions. [2024-10-12 16:09:02,003 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3888 transitions. Word has length 56 [2024-10-12 16:09:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:02,004 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 3888 transitions. [2024-10-12 16:09:02,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 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-10-12 16:09:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3888 transitions. [2024-10-12 16:09:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-12 16:09:02,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:02,014 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:02,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:09:02,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:02,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:02,017 INFO L85 PathProgramCache]: Analyzing trace with hash -846158056, now seen corresponding path program 1 times [2024-10-12 16:09:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:02,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179984377] [2024-10-12 16:09:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 16:09:02,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:02,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179984377] [2024-10-12 16:09:02,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179984377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:02,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:02,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:02,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326882804] [2024-10-12 16:09:02,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:02,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:02,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:02,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:02,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:02,356 INFO L87 Difference]: Start difference. First operand 2662 states and 3888 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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-10-12 16:09:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:05,980 INFO L93 Difference]: Finished difference Result 6141 states and 9711 transitions. [2024-10-12 16:09:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:05,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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 181 [2024-10-12 16:09:05,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:05,998 INFO L225 Difference]: With dead ends: 6141 [2024-10-12 16:09:05,998 INFO L226 Difference]: Without dead ends: 4267 [2024-10-12 16:09:06,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:09:06,003 INFO L432 NwaCegarLoop]: 1037 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 3287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:06,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1186 Invalid, 3287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-12 16:09:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2024-10-12 16:09:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4253. [2024-10-12 16:09:06,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4253 states, 4252 states have (on average 1.351599247412982) internal successors, (5747), 4252 states have internal predecessors, (5747), 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-10-12 16:09:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 5747 transitions. [2024-10-12 16:09:06,097 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 5747 transitions. Word has length 181 [2024-10-12 16:09:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:06,098 INFO L471 AbstractCegarLoop]: Abstraction has 4253 states and 5747 transitions. [2024-10-12 16:09:06,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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-10-12 16:09:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 5747 transitions. [2024-10-12 16:09:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-12 16:09:06,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:06,107 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:09:06,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:09:06,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:06,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:06,108 INFO L85 PathProgramCache]: Analyzing trace with hash -587684820, now seen corresponding path program 1 times [2024-10-12 16:09:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:06,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644108431] [2024-10-12 16:09:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:06,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:06,429 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:09:06,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:06,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644108431] [2024-10-12 16:09:06,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644108431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:06,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:06,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:06,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809005774] [2024-10-12 16:09:06,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:06,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:06,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:06,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:06,438 INFO L87 Difference]: Start difference. First operand 4253 states and 5747 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-10-12 16:09:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:10,021 INFO L93 Difference]: Finished difference Result 10896 states and 15273 transitions. [2024-10-12 16:09:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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 223 [2024-10-12 16:09:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:10,049 INFO L225 Difference]: With dead ends: 10896 [2024-10-12 16:09:10,050 INFO L226 Difference]: Without dead ends: 7431 [2024-10-12 16:09:10,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:09:10,059 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 905 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 755 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:10,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 953 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [755 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-12 16:09:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2024-10-12 16:09:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7425. [2024-10-12 16:09:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7425 states, 7424 states have (on average 1.288927801724138) internal successors, (9569), 7424 states have internal predecessors, (9569), 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-10-12 16:09:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 9569 transitions. [2024-10-12 16:09:10,183 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 9569 transitions. Word has length 223 [2024-10-12 16:09:10,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:10,186 INFO L471 AbstractCegarLoop]: Abstraction has 7425 states and 9569 transitions. [2024-10-12 16:09:10,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-10-12 16:09:10,186 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 9569 transitions. [2024-10-12 16:09:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-12 16:09:10,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:10,191 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:09:10,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:09:10,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:10,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:10,192 INFO L85 PathProgramCache]: Analyzing trace with hash -867165233, now seen corresponding path program 1 times [2024-10-12 16:09:10,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:10,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486039111] [2024-10-12 16:09:10,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:10,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-12 16:09:10,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:10,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486039111] [2024-10-12 16:09:10,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486039111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:10,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:10,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463957445] [2024-10-12 16:09:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:10,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:10,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:10,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:10,423 INFO L87 Difference]: Start difference. First operand 7425 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-10-12 16:09:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:13,576 INFO L93 Difference]: Finished difference Result 19618 states and 25903 transitions. [2024-10-12 16:09:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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 237 [2024-10-12 16:09:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:13,619 INFO L225 Difference]: With dead ends: 19618 [2024-10-12 16:09:13,619 INFO L226 Difference]: Without dead ends: 12981 [2024-10-12 16:09:13,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:09:13,630 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 907 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:13,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 635 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 16:09:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2024-10-12 16:09:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12974. [2024-10-12 16:09:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12974 states, 12973 states have (on average 1.2719494334386803) internal successors, (16501), 12973 states have internal predecessors, (16501), 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-10-12 16:09:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12974 states to 12974 states and 16501 transitions. [2024-10-12 16:09:13,857 INFO L78 Accepts]: Start accepts. Automaton has 12974 states and 16501 transitions. Word has length 237 [2024-10-12 16:09:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:13,858 INFO L471 AbstractCegarLoop]: Abstraction has 12974 states and 16501 transitions. [2024-10-12 16:09:13,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 2 states have internal predecessors, (154), 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-10-12 16:09:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 12974 states and 16501 transitions. [2024-10-12 16:09:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-10-12 16:09:13,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:13,865 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:13,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:09:13,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:13,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:13,866 INFO L85 PathProgramCache]: Analyzing trace with hash -806435540, now seen corresponding path program 1 times [2024-10-12 16:09:13,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:13,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225741449] [2024-10-12 16:09:13,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:13,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-12 16:09:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225741449] [2024-10-12 16:09:14,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225741449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:14,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:14,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664072808] [2024-10-12 16:09:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:14,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:14,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:14,141 INFO L87 Difference]: Start difference. First operand 12974 states and 16501 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 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-10-12 16:09:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:17,278 INFO L93 Difference]: Finished difference Result 36179 states and 46591 transitions. [2024-10-12 16:09:17,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:17,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 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 253 [2024-10-12 16:09:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:17,340 INFO L225 Difference]: With dead ends: 36179 [2024-10-12 16:09:17,341 INFO L226 Difference]: Without dead ends: 23993 [2024-10-12 16:09:17,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:09:17,361 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:17,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 984 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 16:09:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23993 states. [2024-10-12 16:09:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23993 to 22415. [2024-10-12 16:09:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22415 states, 22414 states have (on average 1.2111626661907737) internal successors, (27147), 22414 states have internal predecessors, (27147), 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-10-12 16:09:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22415 states to 22415 states and 27147 transitions. [2024-10-12 16:09:17,760 INFO L78 Accepts]: Start accepts. Automaton has 22415 states and 27147 transitions. Word has length 253 [2024-10-12 16:09:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:17,761 INFO L471 AbstractCegarLoop]: Abstraction has 22415 states and 27147 transitions. [2024-10-12 16:09:17,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 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-10-12 16:09:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 22415 states and 27147 transitions. [2024-10-12 16:09:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-10-12 16:09:17,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:17,767 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:09:17,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:09:17,768 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:17,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash -312519671, now seen corresponding path program 1 times [2024-10-12 16:09:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:17,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625869198] [2024-10-12 16:09:17,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:17,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-12 16:09:17,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:17,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625869198] [2024-10-12 16:09:17,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625869198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:17,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:17,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:09:17,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768613194] [2024-10-12 16:09:17,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:17,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:17,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:17,991 INFO L87 Difference]: Start difference. First operand 22415 states and 27147 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-10-12 16:09:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:21,146 INFO L93 Difference]: Finished difference Result 55857 states and 69067 transitions. [2024-10-12 16:09:21,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:21,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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 296 [2024-10-12 16:09:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:21,192 INFO L225 Difference]: With dead ends: 55857 [2024-10-12 16:09:21,192 INFO L226 Difference]: Without dead ends: 34230 [2024-10-12 16:09:21,217 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-10-12 16:09:21,218 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 887 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:21,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 924 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 16:09:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34230 states. [2024-10-12 16:09:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34230 to 33433. [2024-10-12 16:09:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33433 states, 33432 states have (on average 1.1906257477865518) internal successors, (39805), 33432 states have internal predecessors, (39805), 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-10-12 16:09:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33433 states to 33433 states and 39805 transitions. [2024-10-12 16:09:21,797 INFO L78 Accepts]: Start accepts. Automaton has 33433 states and 39805 transitions. Word has length 296 [2024-10-12 16:09:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:21,797 INFO L471 AbstractCegarLoop]: Abstraction has 33433 states and 39805 transitions. [2024-10-12 16:09:21,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 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-10-12 16:09:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 33433 states and 39805 transitions. [2024-10-12 16:09:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-12 16:09:21,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:21,810 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:21,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:09:21,810 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:21,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1308600309, now seen corresponding path program 1 times [2024-10-12 16:09:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:21,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849125416] [2024-10-12 16:09:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-12 16:09:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:22,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849125416] [2024-10-12 16:09:22,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849125416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:22,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:22,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:09:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793020599] [2024-10-12 16:09:22,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:22,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:09:22,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:22,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:09:22,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:09:22,230 INFO L87 Difference]: Start difference. First operand 33433 states and 39805 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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-10-12 16:09:28,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:28,832 INFO L93 Difference]: Finished difference Result 117459 states and 141038 transitions. [2024-10-12 16:09:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:09:28,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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 344 [2024-10-12 16:09:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:28,944 INFO L225 Difference]: With dead ends: 117459 [2024-10-12 16:09:28,944 INFO L226 Difference]: Without dead ends: 84814 [2024-10-12 16:09:28,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:09:28,993 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 1727 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 6676 mSolverCounterSat, 1118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 7794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1118 IncrementalHoareTripleChecker+Valid, 6676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:28,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 729 Invalid, 7794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1118 Valid, 6676 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-12 16:09:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84814 states. [2024-10-12 16:09:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84814 to 83899. [2024-10-12 16:09:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83899 states, 83898 states have (on average 1.173555984648025) internal successors, (98459), 83898 states have internal predecessors, (98459), 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-10-12 16:09:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83899 states to 83899 states and 98459 transitions. [2024-10-12 16:09:30,036 INFO L78 Accepts]: Start accepts. Automaton has 83899 states and 98459 transitions. Word has length 344 [2024-10-12 16:09:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:30,037 INFO L471 AbstractCegarLoop]: Abstraction has 83899 states and 98459 transitions. [2024-10-12 16:09:30,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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-10-12 16:09:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 83899 states and 98459 transitions. [2024-10-12 16:09:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-10-12 16:09:30,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:30,044 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:09:30,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:09:30,045 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:30,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:30,045 INFO L85 PathProgramCache]: Analyzing trace with hash -205540780, now seen corresponding path program 1 times [2024-10-12 16:09:30,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:30,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971400360] [2024-10-12 16:09:30,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:30,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-10-12 16:09:30,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:30,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971400360] [2024-10-12 16:09:30,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971400360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:30,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:30,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:30,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408394271] [2024-10-12 16:09:30,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:30,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:30,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:30,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:30,848 INFO L87 Difference]: Start difference. First operand 83899 states and 98459 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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-10-12 16:09:34,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:34,284 INFO L93 Difference]: Finished difference Result 156776 states and 185082 transitions. [2024-10-12 16:09:34,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:34,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 353 [2024-10-12 16:09:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:34,384 INFO L225 Difference]: With dead ends: 156776 [2024-10-12 16:09:34,385 INFO L226 Difference]: Without dead ends: 83908 [2024-10-12 16:09:34,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-12 16:09:34,439 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 728 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:34,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1199 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2706 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 16:09:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83908 states. [2024-10-12 16:09:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83908 to 83899. [2024-10-12 16:09:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83899 states, 83898 states have (on average 1.1727812343560038) internal successors, (98394), 83898 states have internal predecessors, (98394), 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-10-12 16:09:35,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83899 states to 83899 states and 98394 transitions. [2024-10-12 16:09:35,692 INFO L78 Accepts]: Start accepts. Automaton has 83899 states and 98394 transitions. Word has length 353 [2024-10-12 16:09:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:35,692 INFO L471 AbstractCegarLoop]: Abstraction has 83899 states and 98394 transitions. [2024-10-12 16:09:35,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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-10-12 16:09:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 83899 states and 98394 transitions. [2024-10-12 16:09:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-10-12 16:09:35,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:35,700 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:09:35,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:09:35,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:35,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1633689514, now seen corresponding path program 1 times [2024-10-12 16:09:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669683408] [2024-10-12 16:09:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 281 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-12 16:09:37,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:37,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669683408] [2024-10-12 16:09:37,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669683408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:09:37,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221643128] [2024-10-12 16:09:37,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:37,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:09:37,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:09:37,181 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-10-12 16:09:37,184 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-10-12 16:09:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:37,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:09:37,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:09:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-10-12 16:09:37,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:09:37,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221643128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:37,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:09:37,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:09:37,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260379021] [2024-10-12 16:09:37,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:37,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:37,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:37,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:37,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:09:37,552 INFO L87 Difference]: Start difference. First operand 83899 states and 98394 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-10-12 16:09:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:40,786 INFO L93 Difference]: Finished difference Result 167008 states and 195994 transitions. [2024-10-12 16:09:40,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:40,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 382 [2024-10-12 16:09:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:40,897 INFO L225 Difference]: With dead ends: 167008 [2024-10-12 16:09:40,897 INFO L226 Difference]: Without dead ends: 83897 [2024-10-12 16:09:40,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:09:40,915 INFO L432 NwaCegarLoop]: 1363 mSDtfsCounter, 1123 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:40,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1444 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:09:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83897 states. [2024-10-12 16:09:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83897 to 83109. [2024-10-12 16:09:41,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83109 states, 83108 states have (on average 1.1286157770611733) internal successors, (93797), 83108 states have internal predecessors, (93797), 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-10-12 16:09:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83109 states to 83109 states and 93797 transitions. [2024-10-12 16:09:41,794 INFO L78 Accepts]: Start accepts. Automaton has 83109 states and 93797 transitions. Word has length 382 [2024-10-12 16:09:41,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:41,794 INFO L471 AbstractCegarLoop]: Abstraction has 83109 states and 93797 transitions. [2024-10-12 16:09:41,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-10-12 16:09:41,794 INFO L276 IsEmpty]: Start isEmpty. Operand 83109 states and 93797 transitions. [2024-10-12 16:09:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2024-10-12 16:09:41,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:41,803 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:41,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:09:42,003 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,SelfDestructingSolverStorable9 [2024-10-12 16:09:42,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:42,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:42,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1723114327, now seen corresponding path program 1 times [2024-10-12 16:09:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:42,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077572149] [2024-10-12 16:09:42,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:42,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 548 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-12 16:09:42,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:42,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077572149] [2024-10-12 16:09:42,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077572149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:42,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:42,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:09:42,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100106434] [2024-10-12 16:09:42,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:42,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:42,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:42,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:42,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:42,646 INFO L87 Difference]: Start difference. First operand 83109 states and 93797 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-10-12 16:09:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:46,522 INFO L93 Difference]: Finished difference Result 191410 states and 218502 transitions. [2024-10-12 16:09:46,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:46,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 412 [2024-10-12 16:09:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:46,651 INFO L225 Difference]: With dead ends: 191410 [2024-10-12 16:09:46,652 INFO L226 Difference]: Without dead ends: 109089 [2024-10-12 16:09:46,680 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-10-12 16:09:46,681 INFO L432 NwaCegarLoop]: 857 mSDtfsCounter, 891 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 3357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 933 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:46,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 942 Invalid, 3357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [933 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 16:09:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109089 states. [2024-10-12 16:09:47,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109089 to 107495. [2024-10-12 16:09:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107495 states, 107494 states have (on average 1.1328074125067447) internal successors, (121770), 107494 states have internal predecessors, (121770), 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-10-12 16:09:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107495 states to 107495 states and 121770 transitions. [2024-10-12 16:09:48,081 INFO L78 Accepts]: Start accepts. Automaton has 107495 states and 121770 transitions. Word has length 412 [2024-10-12 16:09:48,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:48,082 INFO L471 AbstractCegarLoop]: Abstraction has 107495 states and 121770 transitions. [2024-10-12 16:09:48,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-10-12 16:09:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 107495 states and 121770 transitions. [2024-10-12 16:09:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2024-10-12 16:09:48,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:48,099 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 16:09:48,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:09:48,099 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:48,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:48,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1118780156, now seen corresponding path program 1 times [2024-10-12 16:09:48,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:48,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743110659] [2024-10-12 16:09:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:48,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 446 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-12 16:09:48,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:48,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743110659] [2024-10-12 16:09:48,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743110659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:48,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:48,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:09:48,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59924721] [2024-10-12 16:09:48,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:48,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:48,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:48,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:48,882 INFO L87 Difference]: Start difference. First operand 107495 states and 121770 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-10-12 16:09:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:52,655 INFO L93 Difference]: Finished difference Result 239401 states and 273696 transitions. [2024-10-12 16:09:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:52,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 450 [2024-10-12 16:09:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:52,823 INFO L225 Difference]: With dead ends: 239401 [2024-10-12 16:09:52,823 INFO L226 Difference]: Without dead ends: 132694 [2024-10-12 16:09:52,887 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-10-12 16:09:52,887 INFO L432 NwaCegarLoop]: 1785 mSDtfsCounter, 781 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:52,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1935 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 16:09:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132694 states. [2024-10-12 16:09:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132694 to 132677. [2024-10-12 16:09:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132677 states, 132676 states have (on average 1.116486779824535) internal successors, (148131), 132676 states have internal predecessors, (148131), 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-10-12 16:09:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132677 states to 132677 states and 148131 transitions. [2024-10-12 16:09:54,725 INFO L78 Accepts]: Start accepts. Automaton has 132677 states and 148131 transitions. Word has length 450 [2024-10-12 16:09:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:54,725 INFO L471 AbstractCegarLoop]: Abstraction has 132677 states and 148131 transitions. [2024-10-12 16:09:54,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-10-12 16:09:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 132677 states and 148131 transitions. [2024-10-12 16:09:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-10-12 16:09:54,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:54,746 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:54,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:09:54,746 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:54,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:54,747 INFO L85 PathProgramCache]: Analyzing trace with hash -141274767, now seen corresponding path program 1 times [2024-10-12 16:09:54,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:54,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950092352] [2024-10-12 16:09:54,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:54,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 347 proven. 113 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-12 16:09:57,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:57,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950092352] [2024-10-12 16:09:57,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950092352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:09:57,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704919244] [2024-10-12 16:09:57,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:57,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:09:57,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:09:57,040 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-10-12 16:09:57,041 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-10-12 16:09:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:57,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:09:57,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:09:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-12 16:09:57,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:09:57,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704919244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:57,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:09:57,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-12 16:09:57,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59862885] [2024-10-12 16:09:57,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:57,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:57,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:09:57,436 INFO L87 Difference]: Start difference. First operand 132677 states and 148131 transitions. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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)