./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/Problem12_label29.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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/Problem12_label29.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 5b97ff5ceba251ab7fbafe0c3432eac346423cbbff0a928a797ba0e4f7876661 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:32:24,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:32:24,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:32:24,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:32:24,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:32:24,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:32:24,968 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:32:24,968 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:32:24,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:32:24,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:32:24,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:32:24,970 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:32:24,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:32:24,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:32:24,971 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:32:24,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:32:24,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:32:24,975 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:32:24,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:32:24,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:32:24,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:32:24,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:32:24,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:32:24,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:32:24,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:32:24,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:32:24,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:32:24,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:32:24,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:32:24,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:32:24,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:32:24,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:32:24,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:32:24,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:32:24,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:32:24,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:32:24,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:32:24,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:32:24,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:32:24,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:32:24,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:32:24,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:32:24,983 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 -> 5b97ff5ceba251ab7fbafe0c3432eac346423cbbff0a928a797ba0e4f7876661 [2024-10-13 23:32:25,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:32:25,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:32:25,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:32:25,265 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:32:25,266 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:32:25,267 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label29.c [2024-10-13 23:32:26,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:32:27,144 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:32:27,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label29.c [2024-10-13 23:32:27,180 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0b265ab/b22273b25abd4989b39437ec417f9c54/FLAG666839d14 [2024-10-13 23:32:27,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0b265ab/b22273b25abd4989b39437ec417f9c54 [2024-10-13 23:32:27,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:32:27,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:32:27,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:32:27,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:32:27,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:32:27,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:32:27" (1/1) ... [2024-10-13 23:32:27,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268dbb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:27, skipping insertion in model container [2024-10-13 23:32:27,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:32:27" (1/1) ... [2024-10-13 23:32:27,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:32:27,559 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/Problem12_label29.c[6855,6868] [2024-10-13 23:32:28,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:32:28,364 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:32:28,393 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/Problem12_label29.c[6855,6868] [2024-10-13 23:32:28,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:32:28,846 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:32:28,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28 WrapperNode [2024-10-13 23:32:28,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:32:28,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:32:28,848 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:32:28,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:32:28,855 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:28,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,263 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-10-13 23:32:29,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:32:29,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:32:29,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:32:29,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:32:29,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,517 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-13 23:32:29,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:32:29,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:32:29,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:32:29,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:32:29,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (1/1) ... [2024-10-13 23:32:29,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:32:29,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:32:29,815 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-13 23:32:29,818 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-13 23:32:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:32:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:32:29,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:32:29,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:32:29,918 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:32:29,920 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:32:34,020 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-10-13 23:32:34,020 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:32:34,088 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:32:34,088 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:32:34,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:32:34 BoogieIcfgContainer [2024-10-13 23:32:34,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:32:34,091 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:32:34,091 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:32:34,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:32:34,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:32:27" (1/3) ... [2024-10-13 23:32:34,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3645f751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:32:34, skipping insertion in model container [2024-10-13 23:32:34,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:32:28" (2/3) ... [2024-10-13 23:32:34,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3645f751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:32:34, skipping insertion in model container [2024-10-13 23:32:34,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:32:34" (3/3) ... [2024-10-13 23:32:34,098 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label29.c [2024-10-13 23:32:34,117 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:32:34,117 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:32:34,218 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:32:34,226 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;@1a0284de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:32:34,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:32:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 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-13 23:32:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 23:32:34,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:34,242 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] [2024-10-13 23:32:34,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:34,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:34,248 INFO L85 PathProgramCache]: Analyzing trace with hash -590736746, now seen corresponding path program 1 times [2024-10-13 23:32:34,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:34,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053675764] [2024-10-13 23:32:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:34,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:34,430 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-13 23:32:34,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:34,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053675764] [2024-10-13 23:32:34,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053675764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:34,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:34,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:32:34,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142728874] [2024-10-13 23:32:34,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:34,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:32:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:32:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:32:34,467 INFO L87 Difference]: Start difference. First operand has 756 states, 754 states have (on average 1.993368700265252) internal successors, (1503), 755 states have internal predecessors, (1503), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:32:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:32:34,564 INFO L93 Difference]: Finished difference Result 1511 states and 3005 transitions. [2024-10-13 23:32:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:32:34,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-13 23:32:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:32:34,636 INFO L225 Difference]: With dead ends: 1511 [2024-10-13 23:32:34,636 INFO L226 Difference]: Without dead ends: 754 [2024-10-13 23:32:34,644 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-13 23:32:34,648 INFO L432 NwaCegarLoop]: 1438 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, 1438 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-13 23:32:34,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1438 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:32:34,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2024-10-13 23:32:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2024-10-13 23:32:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 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-13 23:32:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2024-10-13 23:32:34,737 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 54 [2024-10-13 23:32:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:32:34,738 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2024-10-13 23:32:34,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:32:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2024-10-13 23:32:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 23:32:34,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:34,740 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] [2024-10-13 23:32:34,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:32:34,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:34,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash -213528142, now seen corresponding path program 1 times [2024-10-13 23:32:34,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:34,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103361864] [2024-10-13 23:32:34,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:34,967 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-13 23:32:34,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:34,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103361864] [2024-10-13 23:32:34,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103361864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:34,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:34,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:32:34,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412508269] [2024-10-13 23:32:34,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:34,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:32:34,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:34,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:32:34,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:32:34,974 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:32:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:32:38,314 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2024-10-13 23:32:38,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:32:38,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-13 23:32:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:32:38,321 INFO L225 Difference]: With dead ends: 2258 [2024-10-13 23:32:38,322 INFO L226 Difference]: Without dead ends: 1505 [2024-10-13 23:32:38,323 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-13 23:32:38,324 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 746 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:32:38,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 473 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 23:32:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2024-10-13 23:32:38,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2024-10-13 23:32:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6070478723404256) internal successors, (2417), 1504 states have internal predecessors, (2417), 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-13 23:32:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2417 transitions. [2024-10-13 23:32:38,375 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2417 transitions. Word has length 54 [2024-10-13 23:32:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:32:38,376 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2417 transitions. [2024-10-13 23:32:38,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 2 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:32:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2417 transitions. [2024-10-13 23:32:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 23:32:38,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:38,382 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, 1, 1, 1, 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-13 23:32:38,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:32:38,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:38,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1367380244, now seen corresponding path program 1 times [2024-10-13 23:32:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:38,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146857111] [2024-10-13 23:32:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:32:38,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:38,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146857111] [2024-10-13 23:32:38,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146857111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:38,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:38,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:32:38,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657672081] [2024-10-13 23:32:38,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:38,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:32:38,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:38,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:32:38,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:32:38,603 INFO L87 Difference]: Start difference. First operand 1505 states and 2417 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-13 23:32:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:32:41,808 INFO L93 Difference]: Finished difference Result 4511 states and 7248 transitions. [2024-10-13 23:32:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:32:41,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2024-10-13 23:32:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:32:41,821 INFO L225 Difference]: With dead ends: 4511 [2024-10-13 23:32:41,821 INFO L226 Difference]: Without dead ends: 3007 [2024-10-13 23:32:41,826 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-13 23:32:41,827 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 774 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:32:41,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 447 Invalid, 2931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:32:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-10-13 23:32:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2024-10-13 23:32:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.4158349966733201) internal successors, (4256), 3006 states have internal predecessors, (4256), 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-13 23:32:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4256 transitions. [2024-10-13 23:32:41,885 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4256 transitions. Word has length 129 [2024-10-13 23:32:41,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:32:41,886 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4256 transitions. [2024-10-13 23:32:41,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-13 23:32:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4256 transitions. [2024-10-13 23:32:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 23:32:41,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:41,891 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, 1, 1, 1, 1, 1, 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-13 23:32:41,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:32:41,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash -661137903, now seen corresponding path program 1 times [2024-10-13 23:32:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:41,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116744782] [2024-10-13 23:32:41,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:41,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:42,266 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:32:42,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:42,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116744782] [2024-10-13 23:32:42,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116744782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:42,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:42,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:32:42,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562972881] [2024-10-13 23:32:42,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:42,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:32:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:42,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:32:42,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:32:42,269 INFO L87 Difference]: Start difference. First operand 3007 states and 4256 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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-13 23:32:46,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:32:46,328 INFO L93 Difference]: Finished difference Result 9768 states and 13600 transitions. [2024-10-13 23:32:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:32:46,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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 131 [2024-10-13 23:32:46,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:32:46,349 INFO L225 Difference]: With dead ends: 9768 [2024-10-13 23:32:46,349 INFO L226 Difference]: Without dead ends: 6762 [2024-10-13 23:32:46,353 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-13 23:32:46,355 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 2179 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4713 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2179 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 4713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:32:46,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2179 Valid, 164 Invalid, 5460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 4713 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-13 23:32:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6762 states. [2024-10-13 23:32:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6762 to 6762. [2024-10-13 23:32:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6762 states, 6761 states have (on average 1.350835675195977) internal successors, (9133), 6761 states have internal predecessors, (9133), 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-13 23:32:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6762 states to 6762 states and 9133 transitions. [2024-10-13 23:32:46,464 INFO L78 Accepts]: Start accepts. Automaton has 6762 states and 9133 transitions. Word has length 131 [2024-10-13 23:32:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:32:46,464 INFO L471 AbstractCegarLoop]: Abstraction has 6762 states and 9133 transitions. [2024-10-13 23:32:46,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 3 states have internal predecessors, (131), 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-13 23:32:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 6762 states and 9133 transitions. [2024-10-13 23:32:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 23:32:46,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:46,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:32:46,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:32:46,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:46,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:46,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1252744443, now seen corresponding path program 1 times [2024-10-13 23:32:46,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:46,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332761329] [2024-10-13 23:32:46,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:46,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 23:32:46,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:46,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332761329] [2024-10-13 23:32:46,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332761329] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:32:46,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859122631] [2024-10-13 23:32:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:46,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:32:46,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:32:46,941 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-13 23:32:46,945 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-13 23:32:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:47,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:32:47,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:32:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-13 23:32:47,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:32:47,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859122631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:47,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:32:47,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-13 23:32:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580948059] [2024-10-13 23:32:47,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:47,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:32:47,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:47,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:32:47,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:32:47,330 INFO L87 Difference]: Start difference. First operand 6762 states and 9133 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-13 23:32:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:32:49,670 INFO L93 Difference]: Finished difference Result 15776 states and 21143 transitions. [2024-10-13 23:32:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:32:49,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 199 [2024-10-13 23:32:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:32:49,700 INFO L225 Difference]: With dead ends: 15776 [2024-10-13 23:32:49,700 INFO L226 Difference]: Without dead ends: 9766 [2024-10-13 23:32:49,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 23:32:49,709 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 712 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:32:49,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 154 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 23:32:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9766 states. [2024-10-13 23:32:49,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9766 to 9766. [2024-10-13 23:32:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9766 states, 9765 states have (on average 1.2557091653865848) internal successors, (12262), 9765 states have internal predecessors, (12262), 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-13 23:32:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9766 states to 9766 states and 12262 transitions. [2024-10-13 23:32:49,910 INFO L78 Accepts]: Start accepts. Automaton has 9766 states and 12262 transitions. Word has length 199 [2024-10-13 23:32:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:32:49,911 INFO L471 AbstractCegarLoop]: Abstraction has 9766 states and 12262 transitions. [2024-10-13 23:32:49,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-13 23:32:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 9766 states and 12262 transitions. [2024-10-13 23:32:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-10-13 23:32:49,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:49,917 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, 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-13 23:32:49,934 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-13 23:32:50,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:32:50,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:50,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash 944977603, now seen corresponding path program 1 times [2024-10-13 23:32:50,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:50,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111444570] [2024-10-13 23:32:50,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-13 23:32:50,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111444570] [2024-10-13 23:32:50,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111444570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:50,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:50,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:32:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739471824] [2024-10-13 23:32:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:50,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:32:50,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:50,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:32:50,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:32:50,551 INFO L87 Difference]: Start difference. First operand 9766 states and 12262 transitions. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 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-13 23:32:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:32:53,804 INFO L93 Difference]: Finished difference Result 27117 states and 34545 transitions. [2024-10-13 23:32:53,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:32:53,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 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 266 [2024-10-13 23:32:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:32:53,842 INFO L225 Difference]: With dead ends: 27117 [2024-10-13 23:32:53,842 INFO L226 Difference]: Without dead ends: 18029 [2024-10-13 23:32:53,851 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-13 23:32:53,852 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 850 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 4088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:32:53,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 362 Invalid, 4088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-13 23:32:53,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18029 states. [2024-10-13 23:32:54,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18029 to 15774. [2024-10-13 23:32:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15774 states, 15773 states have (on average 1.1934318138591264) internal successors, (18824), 15773 states have internal predecessors, (18824), 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-13 23:32:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15774 states to 15774 states and 18824 transitions. [2024-10-13 23:32:54,100 INFO L78 Accepts]: Start accepts. Automaton has 15774 states and 18824 transitions. Word has length 266 [2024-10-13 23:32:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:32:54,100 INFO L471 AbstractCegarLoop]: Abstraction has 15774 states and 18824 transitions. [2024-10-13 23:32:54,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 3 states have internal predecessors, (197), 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-13 23:32:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 15774 states and 18824 transitions. [2024-10-13 23:32:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-10-13 23:32:54,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:54,107 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:32:54,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:32:54,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:54,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1956085295, now seen corresponding path program 1 times [2024-10-13 23:32:54,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:54,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596543981] [2024-10-13 23:32:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:54,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 335 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-13 23:32:54,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:54,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596543981] [2024-10-13 23:32:54,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596543981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:54,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:54,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:32:54,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274906252] [2024-10-13 23:32:54,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:54,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:32:54,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:54,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:32:54,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:32:54,379 INFO L87 Difference]: Start difference. First operand 15774 states and 18824 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:32:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:32:57,152 INFO L93 Difference]: Finished difference Result 39057 states and 47477 transitions. [2024-10-13 23:32:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:32:57,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2024-10-13 23:32:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:32:57,191 INFO L225 Difference]: With dead ends: 39057 [2024-10-13 23:32:57,191 INFO L226 Difference]: Without dead ends: 24035 [2024-10-13 23:32:57,203 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-13 23:32:57,205 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 692 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:32:57,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 428 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:32:57,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24035 states. [2024-10-13 23:32:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24035 to 23284. [2024-10-13 23:32:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23284 states, 23283 states have (on average 1.1873469913670918) internal successors, (27645), 23283 states have internal predecessors, (27645), 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-13 23:32:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23284 states to 23284 states and 27645 transitions. [2024-10-13 23:32:57,501 INFO L78 Accepts]: Start accepts. Automaton has 23284 states and 27645 transitions. Word has length 377 [2024-10-13 23:32:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:32:57,502 INFO L471 AbstractCegarLoop]: Abstraction has 23284 states and 27645 transitions. [2024-10-13 23:32:57,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:32:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand 23284 states and 27645 transitions. [2024-10-13 23:32:57,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-10-13 23:32:57,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:32:57,511 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:32:57,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:32:57,512 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:32:57,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:32:57,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1435779991, now seen corresponding path program 1 times [2024-10-13 23:32:57,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:32:57,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761743888] [2024-10-13 23:32:57,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:32:57,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:32:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:32:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 23:32:57,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:32:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761743888] [2024-10-13 23:32:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761743888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:32:57,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:32:57,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:32:57,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132455542] [2024-10-13 23:32:57,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:32:57,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:32:57,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:32:57,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:32:57,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:32:57,820 INFO L87 Difference]: Start difference. First operand 23284 states and 27645 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:00,362 INFO L93 Difference]: Finished difference Result 54828 states and 66469 transitions. [2024-10-13 23:33:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:00,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 405 [2024-10-13 23:33:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:00,409 INFO L225 Difference]: With dead ends: 54828 [2024-10-13 23:33:00,409 INFO L226 Difference]: Without dead ends: 32296 [2024-10-13 23:33:00,429 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-13 23:33:00,431 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 680 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:00,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1213 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 2251 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:33:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32296 states. [2024-10-13 23:33:00,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32296 to 30043. [2024-10-13 23:33:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30043 states, 30042 states have (on average 1.1742227548099327) internal successors, (35276), 30042 states have internal predecessors, (35276), 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-13 23:33:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30043 states to 30043 states and 35276 transitions. [2024-10-13 23:33:00,754 INFO L78 Accepts]: Start accepts. Automaton has 30043 states and 35276 transitions. Word has length 405 [2024-10-13 23:33:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:00,755 INFO L471 AbstractCegarLoop]: Abstraction has 30043 states and 35276 transitions. [2024-10-13 23:33:00,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 30043 states and 35276 transitions. [2024-10-13 23:33:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-10-13 23:33:00,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:00,770 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:33:00,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:33:00,770 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:00,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:00,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1525929505, now seen corresponding path program 1 times [2024-10-13 23:33:00,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:00,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041031825] [2024-10-13 23:33:00,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:00,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-10-13 23:33:01,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:01,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041031825] [2024-10-13 23:33:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041031825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:01,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:01,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:01,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128806407] [2024-10-13 23:33:01,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:01,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:01,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:01,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:01,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:01,030 INFO L87 Difference]: Start difference. First operand 30043 states and 35276 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:04,004 INFO L93 Difference]: Finished difference Result 68346 states and 81731 transitions. [2024-10-13 23:33:04,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:04,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2024-10-13 23:33:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:04,057 INFO L225 Difference]: With dead ends: 68346 [2024-10-13 23:33:04,058 INFO L226 Difference]: Without dead ends: 39055 [2024-10-13 23:33:04,083 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-13 23:33:04,084 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 778 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 826 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 826 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:04,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 121 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [826 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 23:33:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39055 states. [2024-10-13 23:33:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39055 to 39055. [2024-10-13 23:33:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39055 states, 39054 states have (on average 1.193168433451119) internal successors, (46598), 39054 states have internal predecessors, (46598), 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-13 23:33:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39055 states to 39055 states and 46598 transitions. [2024-10-13 23:33:04,519 INFO L78 Accepts]: Start accepts. Automaton has 39055 states and 46598 transitions. Word has length 409 [2024-10-13 23:33:04,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:04,520 INFO L471 AbstractCegarLoop]: Abstraction has 39055 states and 46598 transitions. [2024-10-13 23:33:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:33:04,520 INFO L276 IsEmpty]: Start isEmpty. Operand 39055 states and 46598 transitions. [2024-10-13 23:33:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-10-13 23:33:04,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:04,528 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:33:04,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 23:33:04,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:04,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:04,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1489111337, now seen corresponding path program 1 times [2024-10-13 23:33:04,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:04,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739570606] [2024-10-13 23:33:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-10-13 23:33:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:04,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739570606] [2024-10-13 23:33:04,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739570606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:04,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:04,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:04,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736270037] [2024-10-13 23:33:04,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:04,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:04,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:04,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:04,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:04,916 INFO L87 Difference]: Start difference. First operand 39055 states and 46598 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-13 23:33:07,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:07,581 INFO L93 Difference]: Finished difference Result 113406 states and 135804 transitions. [2024-10-13 23:33:07,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:07,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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 413 [2024-10-13 23:33:07,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:07,684 INFO L225 Difference]: With dead ends: 113406 [2024-10-13 23:33:07,685 INFO L226 Difference]: Without dead ends: 75103 [2024-10-13 23:33:07,726 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-13 23:33:07,727 INFO L432 NwaCegarLoop]: 1338 mSDtfsCounter, 671 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:07,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1345 Invalid, 2853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [683 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 23:33:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75103 states. [2024-10-13 23:33:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75103 to 71348. [2024-10-13 23:33:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71348 states, 71347 states have (on average 1.1435659523175465) internal successors, (81590), 71347 states have internal predecessors, (81590), 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-13 23:33:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71348 states to 71348 states and 81590 transitions. [2024-10-13 23:33:08,602 INFO L78 Accepts]: Start accepts. Automaton has 71348 states and 81590 transitions. Word has length 413 [2024-10-13 23:33:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:08,603 INFO L471 AbstractCegarLoop]: Abstraction has 71348 states and 81590 transitions. [2024-10-13 23:33:08,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-13 23:33:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 71348 states and 81590 transitions. [2024-10-13 23:33:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2024-10-13 23:33:08,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:08,617 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, 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, 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] [2024-10-13 23:33:08,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 23:33:08,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:08,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:08,618 INFO L85 PathProgramCache]: Analyzing trace with hash 170647591, now seen corresponding path program 1 times [2024-10-13 23:33:08,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:08,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042140610] [2024-10-13 23:33:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 712 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-10-13 23:33:08,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042140610] [2024-10-13 23:33:08,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042140610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:08,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:08,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:08,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137663003] [2024-10-13 23:33:08,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:08,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:08,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:08,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:08,946 INFO L87 Difference]: Start difference. First operand 71348 states and 81590 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-13 23:33:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:12,169 INFO L93 Difference]: Finished difference Result 175739 states and 203334 transitions. [2024-10-13 23:33:12,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 475 [2024-10-13 23:33:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:12,302 INFO L225 Difference]: With dead ends: 175739 [2024-10-13 23:33:12,303 INFO L226 Difference]: Without dead ends: 101388 [2024-10-13 23:33:12,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:12,357 INFO L432 NwaCegarLoop]: 1269 mSDtfsCounter, 707 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:12,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1276 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:33:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101388 states. [2024-10-13 23:33:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101388 to 87870. [2024-10-13 23:33:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87870 states, 87869 states have (on average 1.128486724555873) internal successors, (99159), 87869 states have internal predecessors, (99159), 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-13 23:33:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87870 states to 87870 states and 99159 transitions. [2024-10-13 23:33:13,701 INFO L78 Accepts]: Start accepts. Automaton has 87870 states and 99159 transitions. Word has length 475 [2024-10-13 23:33:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:13,703 INFO L471 AbstractCegarLoop]: Abstraction has 87870 states and 99159 transitions. [2024-10-13 23:33:13,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-13 23:33:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 87870 states and 99159 transitions. [2024-10-13 23:33:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2024-10-13 23:33:13,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:13,754 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, 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, 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] [2024-10-13 23:33:13,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:33:13,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:13,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash 167989212, now seen corresponding path program 1 times [2024-10-13 23:33:13,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:13,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054986408] [2024-10-13 23:33:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 446 proven. 108 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-10-13 23:33:15,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:15,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054986408] [2024-10-13 23:33:15,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054986408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:33:15,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28476026] [2024-10-13 23:33:15,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:15,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:33:15,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:33:15,109 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-13 23:33:15,110 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-13 23:33:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:15,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:33:15,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:33:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-10-13 23:33:15,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:33:15,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28476026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:15,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:33:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:33:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048632126] [2024-10-13 23:33:15,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:15,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:15,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:15,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:33:15,527 INFO L87 Difference]: Start difference. First operand 87870 states and 99159 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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-13 23:33:18,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:18,326 INFO L93 Difference]: Finished difference Result 174988 states and 197561 transitions. [2024-10-13 23:33:18,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:18,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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 546 [2024-10-13 23:33:18,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:18,431 INFO L225 Difference]: With dead ends: 174988 [2024-10-13 23:33:18,432 INFO L226 Difference]: Without dead ends: 87870 [2024-10-13 23:33:18,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:33:18,484 INFO L432 NwaCegarLoop]: 1292 mSDtfsCounter, 684 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:18,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1299 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 23:33:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87870 states. [2024-10-13 23:33:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87870 to 80360. [2024-10-13 23:33:19,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80360 states, 80359 states have (on average 1.0942893764233004) internal successors, (87936), 80359 states have internal predecessors, (87936), 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-13 23:33:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80360 states to 80360 states and 87936 transitions. [2024-10-13 23:33:19,639 INFO L78 Accepts]: Start accepts. Automaton has 80360 states and 87936 transitions. Word has length 546 [2024-10-13 23:33:19,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:19,640 INFO L471 AbstractCegarLoop]: Abstraction has 80360 states and 87936 transitions. [2024-10-13 23:33:19,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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-13 23:33:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 80360 states and 87936 transitions. [2024-10-13 23:33:19,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2024-10-13 23:33:19,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:33:19,668 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 23:33:19,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 23:33:19,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 23:33:19,869 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:33:19,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:33:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1091539351, now seen corresponding path program 1 times [2024-10-13 23:33:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:33:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271782137] [2024-10-13 23:33:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:33:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:33:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:33:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-13 23:33:20,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:33:20,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271782137] [2024-10-13 23:33:20,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271782137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:33:20,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:33:20,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:33:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147278013] [2024-10-13 23:33:20,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:33:20,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:33:20,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:33:20,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:33:20,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:33:20,442 INFO L87 Difference]: Start difference. First operand 80360 states and 87936 transitions. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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-13 23:33:23,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:33:23,460 INFO L93 Difference]: Finished difference Result 185500 states and 203472 transitions. [2024-10-13 23:33:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:33:23,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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 640 [2024-10-13 23:33:23,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:33:23,462 INFO L225 Difference]: With dead ends: 185500 [2024-10-13 23:33:23,462 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:33:23,507 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-13 23:33:23,508 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 442 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:33:23,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1221 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 23:33:23,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:33:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:33:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-13 23:33:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:33:23,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 640 [2024-10-13 23:33:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:33:23,509 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:33:23,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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-13 23:33:23,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:33:23,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:33:23,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:33:23,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 23:33:23,516 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:33:23,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:33:25,174 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:33:25,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:33:25 BoogieIcfgContainer [2024-10-13 23:33:25,192 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:33:25,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:33:25,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:33:25,193 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:33:25,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:32:34" (3/4) ... [2024-10-13 23:33:25,195 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:33:25,247 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-13 23:33:25,252 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:33:25,257 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:33:25,261 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:33:25,661 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:33:25,661 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:33:25,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:33:25,662 INFO L158 Benchmark]: Toolchain (without parser) took 58459.12ms. Allocated memory was 176.2MB in the beginning and 8.4GB in the end (delta: 8.2GB). Free memory was 106.4MB in the beginning and 7.1GB in the end (delta: -6.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-10-13 23:33:25,662 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:33:25,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1643.01ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 105.7MB in the beginning and 172.5MB in the end (delta: -66.8MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-10-13 23:33:25,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 416.51ms. Allocated memory is still 262.1MB. Free memory was 172.5MB in the beginning and 161.5MB in the end (delta: 11.0MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. [2024-10-13 23:33:25,664 INFO L158 Benchmark]: Boogie Preprocessor took 517.61ms. Allocated memory is still 262.1MB. Free memory was 161.5MB in the beginning and 122.7MB in the end (delta: 38.8MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. [2024-10-13 23:33:25,664 INFO L158 Benchmark]: RCFGBuilder took 4305.99ms. Allocated memory was 262.1MB in the beginning and 515.9MB in the end (delta: 253.8MB). Free memory was 122.7MB in the beginning and 182.2MB in the end (delta: -59.5MB). Peak memory consumption was 195.3MB. Max. memory is 16.1GB. [2024-10-13 23:33:25,664 INFO L158 Benchmark]: TraceAbstraction took 51100.72ms. Allocated memory was 515.9MB in the beginning and 8.4GB in the end (delta: 7.8GB). Free memory was 181.2MB in the beginning and 7.1GB in the end (delta: -6.9GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-10-13 23:33:25,665 INFO L158 Benchmark]: Witness Printer took 469.13ms. Allocated memory is still 8.4GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 70.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-13 23:33:25,669 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1643.01ms. Allocated memory was 176.2MB in the beginning and 262.1MB in the end (delta: 86.0MB). Free memory was 105.7MB in the beginning and 172.5MB in the end (delta: -66.8MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 416.51ms. Allocated memory is still 262.1MB. Free memory was 172.5MB in the beginning and 161.5MB in the end (delta: 11.0MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 517.61ms. Allocated memory is still 262.1MB. Free memory was 161.5MB in the beginning and 122.7MB in the end (delta: 38.8MB). Peak memory consumption was 96.4MB. Max. memory is 16.1GB. * RCFGBuilder took 4305.99ms. Allocated memory was 262.1MB in the beginning and 515.9MB in the end (delta: 253.8MB). Free memory was 122.7MB in the beginning and 182.2MB in the end (delta: -59.5MB). Peak memory consumption was 195.3MB. Max. memory is 16.1GB. * TraceAbstraction took 51100.72ms. Allocated memory was 515.9MB in the beginning and 8.4GB in the end (delta: 7.8GB). Free memory was 181.2MB in the beginning and 7.1GB in the end (delta: -6.9GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 469.13ms. Allocated memory is still 8.4GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 70.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 187]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 756 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.3s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 37.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9915 SdHoareTripleChecker+Valid, 32.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9915 mSDsluCounter, 9941 SdHoareTripleChecker+Invalid, 27.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 7731 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30153 IncrementalHoareTripleChecker+Invalid, 37884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7731 mSolverCounterUnsat, 9841 mSDtfsCounter, 30153 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87870occurred in iteration=11, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 30042 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 4843 NumberOfCodeBlocks, 4843 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4828 ConstructedInterpolants, 0 QuantifiedInterpolants, 13823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 973 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 4871/5022 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4828]: Loop Invariant Derived loop invariant: ((((((a24 == 14) || (255 < a17)) || (a24 == 13)) || (a17 < 112)) || (3 < a5)) || (a7 != 12)) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:33:25,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE