./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/Problem19_label13.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/Problem19_label13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 040acbb5862662fb67bae31d21516f4df49e5ef7778edbe49322faa41e26948d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 00:06:31,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 00:06:31,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 00:06:31,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 00:06:31,358 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 00:06:31,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 00:06:31,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 00:06:31,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 00:06:31,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 00:06:31,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 00:06:31,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 00:06:31,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 00:06:31,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 00:06:31,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 00:06:31,394 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 00:06:31,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 00:06:31,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 00:06:31,399 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 00:06:31,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 00:06:31,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 00:06:31,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 00:06:31,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 00:06:31,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 00:06:31,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 00:06:31,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 00:06:31,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 00:06:31,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 00:06:31,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 00:06:31,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 00:06:31,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 00:06:31,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 00:06:31,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 00:06:31,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:06:31,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 00:06:31,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 00:06:31,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 00:06:31,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 00:06:31,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 00:06:31,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 00:06:31,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 00:06:31,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 00:06:31,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 00:06:31,406 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 -> 040acbb5862662fb67bae31d21516f4df49e5ef7778edbe49322faa41e26948d [2024-10-14 00:06:31,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 00:06:31,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 00:06:31,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 00:06:31,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 00:06:31,666 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 00:06:31,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label13.c [2024-10-14 00:06:33,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 00:06:33,599 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 00:06:33,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label13.c [2024-10-14 00:06:33,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c25444c/a8cfa60a72c142b185bb50008e9a5bf0/FLAG76b467c3c [2024-10-14 00:06:33,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c25444c/a8cfa60a72c142b185bb50008e9a5bf0 [2024-10-14 00:06:33,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 00:06:33,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 00:06:33,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 00:06:33,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 00:06:33,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 00:06:33,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:06:33" (1/1) ... [2024-10-14 00:06:33,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e4776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:33, skipping insertion in model container [2024-10-14 00:06:33,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:06:33" (1/1) ... [2024-10-14 00:06:33,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 00:06:34,152 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/Problem19_label13.c[4813,4826] [2024-10-14 00:06:35,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:06:35,161 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 00:06:35,184 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/Problem19_label13.c[4813,4826] [2024-10-14 00:06:35,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 00:06:35,842 INFO L204 MainTranslator]: Completed translation [2024-10-14 00:06:35,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35 WrapperNode [2024-10-14 00:06:35,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 00:06:35,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 00:06:35,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 00:06:35,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 00:06:35,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:35,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:36,868 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-10-14 00:06:36,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 00:06:36,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 00:06:36,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 00:06:36,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 00:06:36,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:36,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:37,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:37,331 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-14 00:06:37,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:37,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:37,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:37,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:37,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:37,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:38,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 00:06:38,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 00:06:38,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 00:06:38,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 00:06:38,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (1/1) ... [2024-10-14 00:06:38,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 00:06:38,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:06:38,054 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-14 00:06:38,060 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-14 00:06:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 00:06:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 00:06:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 00:06:38,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 00:06:38,171 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 00:06:38,173 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 00:06:45,252 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-10-14 00:06:45,252 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 00:06:45,335 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 00:06:45,336 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 00:06:45,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:06:45 BoogieIcfgContainer [2024-10-14 00:06:45,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 00:06:45,338 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 00:06:45,338 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 00:06:45,341 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 00:06:45,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:06:33" (1/3) ... [2024-10-14 00:06:45,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d693dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:06:45, skipping insertion in model container [2024-10-14 00:06:45,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:06:35" (2/3) ... [2024-10-14 00:06:45,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d693dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:06:45, skipping insertion in model container [2024-10-14 00:06:45,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:06:45" (3/3) ... [2024-10-14 00:06:45,344 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label13.c [2024-10-14 00:06:45,362 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 00:06:45,362 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 00:06:45,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 00:06:45,468 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;@46343595, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 00:06:45,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 00:06:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 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-14 00:06:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 00:06:45,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:06:45,487 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] [2024-10-14 00:06:45,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:06:45,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:06:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2137361790, now seen corresponding path program 1 times [2024-10-14 00:06:45,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:06:45,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157077903] [2024-10-14 00:06:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:06:45,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:06:45,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:06:45,671 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-14 00:06:45,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:06:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157077903] [2024-10-14 00:06:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157077903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:06:45,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:06:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:06:45,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565942025] [2024-10-14 00:06:45,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:06:45,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 00:06:45,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:06:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 00:06:45,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 00:06:45,729 INFO L87 Difference]: Start difference. First operand has 1686 states, 1684 states have (on average 1.902019002375297) internal successors, (3203), 1685 states have internal predecessors, (3203), 0 states have call successors, (0), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-14 00:06:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:06:45,859 INFO L93 Difference]: Finished difference Result 3371 states and 6405 transitions. [2024-10-14 00:06:45,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 00:06:45,862 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-14 00:06:45,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:06:45,890 INFO L225 Difference]: With dead ends: 3371 [2024-10-14 00:06:45,890 INFO L226 Difference]: Without dead ends: 1684 [2024-10-14 00:06:45,904 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-14 00:06:45,911 INFO L432 NwaCegarLoop]: 3138 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, 3138 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-14 00:06:45,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3138 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 00:06:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2024-10-14 00:06:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2024-10-14 00:06:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 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-14 00:06:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2024-10-14 00:06:46,009 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 34 [2024-10-14 00:06:46,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:06:46,009 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2024-10-14 00:06:46,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-14 00:06:46,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2024-10-14 00:06:46,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 00:06:46,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:06:46,011 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] [2024-10-14 00:06:46,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 00:06:46,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:06:46,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:06:46,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2080390040, now seen corresponding path program 1 times [2024-10-14 00:06:46,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:06:46,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168422450] [2024-10-14 00:06:46,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:06:46,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:06:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:06:46,153 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-14 00:06:46,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:06:46,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168422450] [2024-10-14 00:06:46,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168422450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:06:46,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:06:46,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:06:46,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314500351] [2024-10-14 00:06:46,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:06:46,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:06:46,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:06:46,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:06:46,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:06:46,159 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-14 00:06:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:06:52,448 INFO L93 Difference]: Finished difference Result 4862 states and 9131 transitions. [2024-10-14 00:06:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:06:52,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-14 00:06:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:06:52,468 INFO L225 Difference]: With dead ends: 4862 [2024-10-14 00:06:52,468 INFO L226 Difference]: Without dead ends: 3179 [2024-10-14 00:06:52,472 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-14 00:06:52,473 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 1613 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 2020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1613 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 6161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2020 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:06:52,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1613 Valid, 1110 Invalid, 6161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2020 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-14 00:06:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2024-10-14 00:06:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3121. [2024-10-14 00:06:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 3120 states have (on average 1.728525641025641) internal successors, (5393), 3120 states have internal predecessors, (5393), 0 states have call successors, (0), 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-14 00:06:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 5393 transitions. [2024-10-14 00:06:52,554 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 5393 transitions. Word has length 34 [2024-10-14 00:06:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:06:52,554 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 5393 transitions. [2024-10-14 00:06:52,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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-14 00:06:52,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 5393 transitions. [2024-10-14 00:06:52,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 00:06:52,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:06:52,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:06:52,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 00:06:52,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:06:52,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:06:52,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2140059397, now seen corresponding path program 1 times [2024-10-14 00:06:52,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:06:52,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724948705] [2024-10-14 00:06:52,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:06:52,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:06:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:06:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:06:52,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:06:52,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724948705] [2024-10-14 00:06:52,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724948705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:06:52,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:06:52,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:06:52,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199949308] [2024-10-14 00:06:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:06:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:06:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:06:52,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:06:52,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:06:52,735 INFO L87 Difference]: Start difference. First operand 3121 states and 5393 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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-14 00:06:58,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:06:58,572 INFO L93 Difference]: Finished difference Result 9134 states and 15859 transitions. [2024-10-14 00:06:58,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:06:58,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-10-14 00:06:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:06:58,598 INFO L225 Difference]: With dead ends: 9134 [2024-10-14 00:06:58,599 INFO L226 Difference]: Without dead ends: 6014 [2024-10-14 00:06:58,611 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-14 00:06:58,612 INFO L432 NwaCegarLoop]: 719 mSDtfsCounter, 2533 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5119 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-14 00:06:58,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 990 Invalid, 5553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5119 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-14 00:06:58,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6014 states. [2024-10-14 00:06:58,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6014 to 6012. [2024-10-14 00:06:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.6709366162036268) internal successors, (10044), 6011 states have internal predecessors, (10044), 0 states have call successors, (0), 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-14 00:06:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 10044 transitions. [2024-10-14 00:06:58,735 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 10044 transitions. Word has length 102 [2024-10-14 00:06:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:06:58,736 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 10044 transitions. [2024-10-14 00:06:58,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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-14 00:06:58,738 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 10044 transitions. [2024-10-14 00:06:58,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 00:06:58,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:06:58,743 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:06:58,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 00:06:58,743 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:06:58,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:06:58,744 INFO L85 PathProgramCache]: Analyzing trace with hash -202944576, now seen corresponding path program 1 times [2024-10-14 00:06:58,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:06:58,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907753928] [2024-10-14 00:06:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:06:58,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:06:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:06:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:06:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:06:58,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907753928] [2024-10-14 00:06:58,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907753928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:06:58,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:06:58,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:06:58,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999739287] [2024-10-14 00:06:58,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:06:58,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:06:58,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:06:58,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:06:58,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:06:58,906 INFO L87 Difference]: Start difference. First operand 6012 states and 10044 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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-14 00:07:04,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:07:04,531 INFO L93 Difference]: Finished difference Result 17597 states and 29554 transitions. [2024-10-14 00:07:04,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:07:04,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-10-14 00:07:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:07:04,578 INFO L225 Difference]: With dead ends: 17597 [2024-10-14 00:07:04,578 INFO L226 Difference]: Without dead ends: 11586 [2024-10-14 00:07:04,594 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-14 00:07:04,595 INFO L432 NwaCegarLoop]: 1497 mSDtfsCounter, 1534 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4336 mSolverCounterSat, 1470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 5806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1470 IncrementalHoareTripleChecker+Valid, 4336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-14 00:07:04,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1716 Invalid, 5806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1470 Valid, 4336 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-14 00:07:04,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11586 states. [2024-10-14 00:07:04,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11586 to 11551. [2024-10-14 00:07:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11551 states, 11550 states have (on average 1.4577489177489178) internal successors, (16837), 11550 states have internal predecessors, (16837), 0 states have call successors, (0), 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-14 00:07:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11551 states to 11551 states and 16837 transitions. [2024-10-14 00:07:04,781 INFO L78 Accepts]: Start accepts. Automaton has 11551 states and 16837 transitions. Word has length 105 [2024-10-14 00:07:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:07:04,782 INFO L471 AbstractCegarLoop]: Abstraction has 11551 states and 16837 transitions. [2024-10-14 00:07:04,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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-14 00:07:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 11551 states and 16837 transitions. [2024-10-14 00:07:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 00:07:04,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:07:04,786 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:07:04,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 00:07:04,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:07:04,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:07:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1412956273, now seen corresponding path program 1 times [2024-10-14 00:07:04,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:07:04,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744163127] [2024-10-14 00:07:04,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:07:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:07:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:07:05,111 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:07:05,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:07:05,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744163127] [2024-10-14 00:07:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744163127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:07:05,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:07:05,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 00:07:05,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194529757] [2024-10-14 00:07:05,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:07:05,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:07:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:07:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:07:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:07:05,116 INFO L87 Difference]: Start difference. First operand 11551 states and 16837 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 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-14 00:07:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:07:10,542 INFO L93 Difference]: Finished difference Result 34261 states and 50006 transitions. [2024-10-14 00:07:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:07:10,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 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-14 00:07:10,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:07:10,590 INFO L225 Difference]: With dead ends: 34261 [2024-10-14 00:07:10,591 INFO L226 Difference]: Without dead ends: 22711 [2024-10-14 00:07:10,606 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-14 00:07:10,607 INFO L432 NwaCegarLoop]: 1848 mSDtfsCounter, 1750 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 4316 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 5746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:07:10,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 2121 Invalid, 5746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4316 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-14 00:07:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22711 states. [2024-10-14 00:07:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22711 to 22686. [2024-10-14 00:07:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22686 states, 22685 states have (on average 1.281948424068768) internal successors, (29081), 22685 states have internal predecessors, (29081), 0 states have call successors, (0), 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-14 00:07:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22686 states to 22686 states and 29081 transitions. [2024-10-14 00:07:11,088 INFO L78 Accepts]: Start accepts. Automaton has 22686 states and 29081 transitions. Word has length 131 [2024-10-14 00:07:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:07:11,090 INFO L471 AbstractCegarLoop]: Abstraction has 22686 states and 29081 transitions. [2024-10-14 00:07:11,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 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-14 00:07:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 22686 states and 29081 transitions. [2024-10-14 00:07:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-10-14 00:07:11,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:07:11,102 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-14 00:07:11,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 00:07:11,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:07:11,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:07:11,103 INFO L85 PathProgramCache]: Analyzing trace with hash -874815242, now seen corresponding path program 1 times [2024-10-14 00:07:11,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:07:11,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403078114] [2024-10-14 00:07:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:07:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:07:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:07:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-14 00:07:12,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:07:12,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403078114] [2024-10-14 00:07:12,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403078114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:07:12,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:07:12,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:07:12,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726358892] [2024-10-14 00:07:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:07:12,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:07:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:07:12,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:07:12,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:07:12,413 INFO L87 Difference]: Start difference. First operand 22686 states and 29081 transitions. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-14 00:07:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:07:20,083 INFO L93 Difference]: Finished difference Result 57743 states and 72060 transitions. [2024-10-14 00:07:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:07:20,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-14 00:07:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:07:20,147 INFO L225 Difference]: With dead ends: 57743 [2024-10-14 00:07:20,147 INFO L226 Difference]: Without dead ends: 35058 [2024-10-14 00:07:20,177 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-14 00:07:20,178 INFO L432 NwaCegarLoop]: 1789 mSDtfsCounter, 3752 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 9617 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3752 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 9789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 9617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:07:20,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3752 Valid, 2146 Invalid, 9789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 9617 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-10-14 00:07:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35058 states. [2024-10-14 00:07:20,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35058 to 33648. [2024-10-14 00:07:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33648 states, 33647 states have (on average 1.2262608850714773) internal successors, (41260), 33647 states have internal predecessors, (41260), 0 states have call successors, (0), 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-14 00:07:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33648 states to 33648 states and 41260 transitions. [2024-10-14 00:07:20,636 INFO L78 Accepts]: Start accepts. Automaton has 33648 states and 41260 transitions. Word has length 413 [2024-10-14 00:07:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:07:20,636 INFO L471 AbstractCegarLoop]: Abstraction has 33648 states and 41260 transitions. [2024-10-14 00:07:20,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-14 00:07:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 33648 states and 41260 transitions. [2024-10-14 00:07:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2024-10-14 00:07:20,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:07:20,646 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-14 00:07:20,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 00:07:20,646 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:07:20,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:07:20,647 INFO L85 PathProgramCache]: Analyzing trace with hash 547794114, now seen corresponding path program 1 times [2024-10-14 00:07:20,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:07:20,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248857585] [2024-10-14 00:07:20,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:07:20,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:07:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:07:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-10-14 00:07:21,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:07:21,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248857585] [2024-10-14 00:07:21,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248857585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:07:21,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:07:21,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:07:21,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999493312] [2024-10-14 00:07:21,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:07:21,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:07:21,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:07:21,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:07:21,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:07:21,773 INFO L87 Difference]: Start difference. First operand 33648 states and 41260 transitions. Second operand has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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-14 00:07:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:07:29,352 INFO L93 Difference]: Finished difference Result 90599 states and 108577 transitions. [2024-10-14 00:07:29,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:07:29,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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 620 [2024-10-14 00:07:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:07:29,466 INFO L225 Difference]: With dead ends: 90599 [2024-10-14 00:07:29,466 INFO L226 Difference]: Without dead ends: 56952 [2024-10-14 00:07:29,504 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-14 00:07:29,504 INFO L432 NwaCegarLoop]: 1747 mSDtfsCounter, 3757 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 9353 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3757 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 9615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 9353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-10-14 00:07:29,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3757 Valid, 2099 Invalid, 9615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 9353 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-10-14 00:07:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56952 states. [2024-10-14 00:07:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56952 to 52813. [2024-10-14 00:07:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52813 states, 52812 states have (on average 1.1742028326895402) internal successors, (62012), 52812 states have internal predecessors, (62012), 0 states have call successors, (0), 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-14 00:07:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52813 states to 52813 states and 62012 transitions. [2024-10-14 00:07:30,467 INFO L78 Accepts]: Start accepts. Automaton has 52813 states and 62012 transitions. Word has length 620 [2024-10-14 00:07:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:07:30,468 INFO L471 AbstractCegarLoop]: Abstraction has 52813 states and 62012 transitions. [2024-10-14 00:07:30,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.25) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 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-14 00:07:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 52813 states and 62012 transitions. [2024-10-14 00:07:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2024-10-14 00:07:30,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:07:30,477 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2024-10-14 00:07:30,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 00:07:30,478 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:07:30,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:07:30,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1783739620, now seen corresponding path program 1 times [2024-10-14 00:07:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:07:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711708034] [2024-10-14 00:07:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:07:30,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:07:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:07:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-14 00:07:31,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:07:31,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711708034] [2024-10-14 00:07:31,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711708034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:07:31,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:07:31,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:07:31,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627551538] [2024-10-14 00:07:31,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:07:31,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 00:07:31,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:07:31,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 00:07:31,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 00:07:31,396 INFO L87 Difference]: Start difference. First operand 52813 states and 62012 transitions. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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-14 00:07:36,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:07:36,778 INFO L93 Difference]: Finished difference Result 108386 states and 126802 transitions. [2024-10-14 00:07:36,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 00:07:36,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 648 [2024-10-14 00:07:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:07:36,881 INFO L225 Difference]: With dead ends: 108386 [2024-10-14 00:07:36,881 INFO L226 Difference]: Without dead ends: 55543 [2024-10-14 00:07:36,909 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-14 00:07:36,910 INFO L432 NwaCegarLoop]: 1766 mSDtfsCounter, 1151 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 5714 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 5722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-14 00:07:36,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1944 Invalid, 5722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5714 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-14 00:07:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55543 states. [2024-10-14 00:07:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55543 to 55543. [2024-10-14 00:07:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55543 states, 55542 states have (on average 1.1657304382269273) internal successors, (64747), 55542 states have internal predecessors, (64747), 0 states have call successors, (0), 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-14 00:07:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55543 states to 55543 states and 64747 transitions. [2024-10-14 00:07:37,588 INFO L78 Accepts]: Start accepts. Automaton has 55543 states and 64747 transitions. Word has length 648 [2024-10-14 00:07:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:07:37,588 INFO L471 AbstractCegarLoop]: Abstraction has 55543 states and 64747 transitions. [2024-10-14 00:07:37,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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-14 00:07:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 55543 states and 64747 transitions. [2024-10-14 00:07:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2024-10-14 00:07:37,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:07:37,608 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:07:37,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 00:07:37,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:07:37,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:07:37,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2005506464, now seen corresponding path program 1 times [2024-10-14 00:07:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:07:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389883814] [2024-10-14 00:07:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:07:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:07:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:07:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-10-14 00:07:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:07:39,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389883814] [2024-10-14 00:07:39,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389883814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:07:39,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 00:07:39,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 00:07:39,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156851669] [2024-10-14 00:07:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:07:39,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:07:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:07:39,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:07:39,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 00:07:39,115 INFO L87 Difference]: Start difference. First operand 55543 states and 64747 transitions. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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-14 00:07:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 00:07:44,863 INFO L93 Difference]: Finished difference Result 133113 states and 156924 transitions. [2024-10-14 00:07:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 00:07:44,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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 733 [2024-10-14 00:07:44,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 00:07:44,968 INFO L225 Difference]: With dead ends: 133113 [2024-10-14 00:07:44,968 INFO L226 Difference]: Without dead ends: 80301 [2024-10-14 00:07:44,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-14 00:07:45,000 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 1696 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4262 mSolverCounterSat, 2245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2245 IncrementalHoareTripleChecker+Valid, 4262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-14 00:07:45,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 811 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2245 Valid, 4262 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-14 00:07:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80301 states. [2024-10-14 00:07:45,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80301 to 77412. [2024-10-14 00:07:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77412 states, 77411 states have (on average 1.1824934440841741) internal successors, (91538), 77411 states have internal predecessors, (91538), 0 states have call successors, (0), 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-14 00:07:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77412 states to 77412 states and 91538 transitions. [2024-10-14 00:07:45,916 INFO L78 Accepts]: Start accepts. Automaton has 77412 states and 91538 transitions. Word has length 733 [2024-10-14 00:07:45,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 00:07:45,917 INFO L471 AbstractCegarLoop]: Abstraction has 77412 states and 91538 transitions. [2024-10-14 00:07:45,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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-14 00:07:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 77412 states and 91538 transitions. [2024-10-14 00:07:45,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2024-10-14 00:07:45,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 00:07:45,924 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 00:07:45,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 00:07:45,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 00:07:45,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 00:07:45,928 INFO L85 PathProgramCache]: Analyzing trace with hash 181111177, now seen corresponding path program 1 times [2024-10-14 00:07:45,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 00:07:45,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495156781] [2024-10-14 00:07:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:07:45,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 00:07:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:07:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 87 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 00:07:47,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 00:07:47,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495156781] [2024-10-14 00:07:47,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495156781] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 00:07:47,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611001806] [2024-10-14 00:07:47,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 00:07:47,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 00:07:47,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 00:07:47,639 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-14 00:07:47,640 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-14 00:07:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 00:07:47,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 00:07:47,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 00:07:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-14 00:07:47,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 00:07:47,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611001806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 00:07:47,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 00:07:47,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-14 00:07:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841135111] [2024-10-14 00:07:47,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 00:07:47,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 00:07:47,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 00:07:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 00:07:47,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 00:07:47,991 INFO L87 Difference]: Start difference. First operand 77412 states and 91538 transitions. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)