./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 6fd8c0f78f1a02f0110655a19aab6ed326f45dcdd8f1755f6a67e81d29b9a49c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:45:39,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:45:39,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-12 23:45:39,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:45:39,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:45:39,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:45:39,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:45:39,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:45:39,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:45:39,325 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:45:39,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:45:39,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:45:39,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:45:39,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:45:39,328 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:45:39,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:45:39,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:45:39,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:45:39,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:45:39,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:45:39,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:45:39,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:45:39,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:45:39,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:45:39,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:45:39,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:45:39,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:45:39,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:45:39,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:45:39,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:45:39,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:45:39,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:45:39,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:45:39,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:45:39,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:45:39,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:45:39,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:45:39,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:45:39,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:45:39,335 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fd8c0f78f1a02f0110655a19aab6ed326f45dcdd8f1755f6a67e81d29b9a49c [2024-10-12 23:45:39,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:45:39,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:45:39,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:45:39,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:45:39,580 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:45:39,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c [2024-10-12 23:45:40,860 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:45:41,054 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:45:41,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.zaher.c [2024-10-12 23:45:41,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c05bbed/07b8c134cce643ae8f553517b7414256/FLAGdea84214a [2024-10-12 23:45:41,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45c05bbed/07b8c134cce643ae8f553517b7414256 [2024-10-12 23:45:41,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:45:41,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:45:41,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:45:41,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:45:41,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:45:41,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8d17ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41, skipping insertion in model container [2024-10-12 23:45:41,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:45:41,328 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/hardware-verification-bv/btor2c-lazyMod.zaher.c[1245,1258] [2024-10-12 23:45:41,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:45:41,428 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:45:41,442 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/hardware-verification-bv/btor2c-lazyMod.zaher.c[1245,1258] [2024-10-12 23:45:41,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:45:41,525 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:45:41,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41 WrapperNode [2024-10-12 23:45:41,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:45:41,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:45:41,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:45:41,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:45:41,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,621 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 778 [2024-10-12 23:45:41,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:45:41,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:45:41,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:45:41,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:45:41,636 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,696 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-12 23:45:41,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,731 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:45:41,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:45:41,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:45:41,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:45:41,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (1/1) ... [2024-10-12 23:45:41,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:45:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:45:41,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:45:41,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:45:41,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:45:41,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:45:41,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 23:45:41,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:45:41,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:45:41,973 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:45:41,974 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:45:42,687 INFO L? ?]: Removed 340 outVars from TransFormulas that were not future-live. [2024-10-12 23:45:42,688 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:45:42,722 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:45:42,723 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:45:42,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:45:42 BoogieIcfgContainer [2024-10-12 23:45:42,724 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:45:42,726 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:45:42,726 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:45:42,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:45:42,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:45:41" (1/3) ... [2024-10-12 23:45:42,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362eae92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:45:42, skipping insertion in model container [2024-10-12 23:45:42,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:45:41" (2/3) ... [2024-10-12 23:45:42,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362eae92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:45:42, skipping insertion in model container [2024-10-12 23:45:42,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:45:42" (3/3) ... [2024-10-12 23:45:42,732 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.zaher.c [2024-10-12 23:45:42,746 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:45:42,746 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:45:42,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:45:42,797 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;@1f6bba25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:45:42,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:45:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 177 states have (on average 1.502824858757062) internal successors, (266), 178 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 23:45:42,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:42,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:42,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:42,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1330337361, now seen corresponding path program 1 times [2024-10-12 23:45:42,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:42,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464674316] [2024-10-12 23:45:42,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:42,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:43,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:43,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464674316] [2024-10-12 23:45:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464674316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:43,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:43,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:45:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529289232] [2024-10-12 23:45:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:43,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:45:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:43,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:45:43,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:43,506 INFO L87 Difference]: Start difference. First operand has 179 states, 177 states have (on average 1.502824858757062) internal successors, (266), 178 states have internal predecessors, (266), 0 states have call successors, (0), 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 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:43,569 INFO L93 Difference]: Finished difference Result 302 states and 450 transitions. [2024-10-12 23:45:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:43,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-12 23:45:43,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:43,583 INFO L225 Difference]: With dead ends: 302 [2024-10-12 23:45:43,583 INFO L226 Difference]: Without dead ends: 180 [2024-10-12 23:45:43,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:43,588 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:43,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 778 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-12 23:45:43,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-10-12 23:45:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 1.4860335195530727) internal successors, (266), 179 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 266 transitions. [2024-10-12 23:45:43,616 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 266 transitions. Word has length 52 [2024-10-12 23:45:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:43,616 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 266 transitions. [2024-10-12 23:45:43,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 266 transitions. [2024-10-12 23:45:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 23:45:43,618 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:43,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:43,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:45:43,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:43,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1710910234, now seen corresponding path program 1 times [2024-10-12 23:45:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:43,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065809786] [2024-10-12 23:45:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:43,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065809786] [2024-10-12 23:45:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065809786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:45:43,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032424390] [2024-10-12 23:45:43,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:43,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:45:43,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:43,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:45:43,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:43,787 INFO L87 Difference]: Start difference. First operand 180 states and 266 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:43,821 INFO L93 Difference]: Finished difference Result 305 states and 450 transitions. [2024-10-12 23:45:43,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:43,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2024-10-12 23:45:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:43,826 INFO L225 Difference]: With dead ends: 305 [2024-10-12 23:45:43,826 INFO L226 Difference]: Without dead ends: 182 [2024-10-12 23:45:43,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:43,827 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:43,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-12 23:45:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-12 23:45:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 181 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2024-10-12 23:45:43,838 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 53 [2024-10-12 23:45:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:43,838 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2024-10-12 23:45:43,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2024-10-12 23:45:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 23:45:43,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:43,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:43,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:45:43,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:43,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash 400644072, now seen corresponding path program 1 times [2024-10-12 23:45:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:43,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95559810] [2024-10-12 23:45:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:43,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:44,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:44,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:44,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95559810] [2024-10-12 23:45:44,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95559810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:44,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:44,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:45:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958534737] [2024-10-12 23:45:44,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:44,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:44,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:44,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:44,117 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:44,190 INFO L93 Difference]: Finished difference Result 371 states and 543 transitions. [2024-10-12 23:45:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:44,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-12 23:45:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:44,192 INFO L225 Difference]: With dead ends: 371 [2024-10-12 23:45:44,192 INFO L226 Difference]: Without dead ends: 246 [2024-10-12 23:45:44,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:45:44,194 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 406 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:44,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 753 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:44,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-12 23:45:44,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 189. [2024-10-12 23:45:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.4734042553191489) internal successors, (277), 188 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:44,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 277 transitions. [2024-10-12 23:45:44,201 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 277 transitions. Word has length 54 [2024-10-12 23:45:44,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:44,201 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 277 transitions. [2024-10-12 23:45:44,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:44,201 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 277 transitions. [2024-10-12 23:45:44,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-12 23:45:44,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:44,203 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:44,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:45:44,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:44,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1562434507, now seen corresponding path program 1 times [2024-10-12 23:45:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:44,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661887747] [2024-10-12 23:45:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:44,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:44,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661887747] [2024-10-12 23:45:44,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661887747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:44,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:44,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:44,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151953885] [2024-10-12 23:45:44,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:44,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:45:44,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:44,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:45:44,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:45:44,434 INFO L87 Difference]: Start difference. First operand 189 states and 277 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:44,541 INFO L93 Difference]: Finished difference Result 383 states and 559 transitions. [2024-10-12 23:45:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:45:44,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2024-10-12 23:45:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:44,543 INFO L225 Difference]: With dead ends: 383 [2024-10-12 23:45:44,544 INFO L226 Difference]: Without dead ends: 258 [2024-10-12 23:45:44,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:45:44,548 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 438 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:44,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1253 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-12 23:45:44,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 191. [2024-10-12 23:45:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.4684210526315788) internal successors, (279), 190 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 279 transitions. [2024-10-12 23:45:44,558 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 279 transitions. Word has length 55 [2024-10-12 23:45:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:44,559 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 279 transitions. [2024-10-12 23:45:44,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 279 transitions. [2024-10-12 23:45:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-12 23:45:44,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:44,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:44,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:45:44,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:44,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:44,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1859042751, now seen corresponding path program 1 times [2024-10-12 23:45:44,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:44,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165405701] [2024-10-12 23:45:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:44,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:44,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165405701] [2024-10-12 23:45:44,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165405701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:44,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:44,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122981635] [2024-10-12 23:45:44,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:44,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:45:44,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:44,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:45:44,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:45:44,839 INFO L87 Difference]: Start difference. First operand 191 states and 279 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:44,931 INFO L93 Difference]: Finished difference Result 367 states and 534 transitions. [2024-10-12 23:45:44,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:45:44,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-12 23:45:44,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:44,933 INFO L225 Difference]: With dead ends: 367 [2024-10-12 23:45:44,934 INFO L226 Difference]: Without dead ends: 242 [2024-10-12 23:45:44,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:45:44,936 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 385 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:44,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1060 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-12 23:45:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 194. [2024-10-12 23:45:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 193 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2024-10-12 23:45:44,946 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 56 [2024-10-12 23:45:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:44,949 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2024-10-12 23:45:44,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2024-10-12 23:45:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 23:45:44,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:44,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:44,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:45:44,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:44,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1777128024, now seen corresponding path program 1 times [2024-10-12 23:45:44,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:44,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549217617] [2024-10-12 23:45:44,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:45,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:45,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:45,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549217617] [2024-10-12 23:45:45,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549217617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:45,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:45,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:45:45,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844366237] [2024-10-12 23:45:45,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:45,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:45:45,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:45,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:45:45,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:45,108 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:45,128 INFO L93 Difference]: Finished difference Result 321 states and 469 transitions. [2024-10-12 23:45:45,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:45,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2024-10-12 23:45:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:45,129 INFO L225 Difference]: With dead ends: 321 [2024-10-12 23:45:45,129 INFO L226 Difference]: Without dead ends: 196 [2024-10-12 23:45:45,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:45,130 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:45,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-12 23:45:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2024-10-12 23:45:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 195 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 285 transitions. [2024-10-12 23:45:45,134 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 285 transitions. Word has length 57 [2024-10-12 23:45:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:45,134 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 285 transitions. [2024-10-12 23:45:45,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,135 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 285 transitions. [2024-10-12 23:45:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 23:45:45,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:45,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:45,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:45:45,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:45,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1652493217, now seen corresponding path program 1 times [2024-10-12 23:45:45,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:45,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432064149] [2024-10-12 23:45:45,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:45,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:45,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:45,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432064149] [2024-10-12 23:45:45,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432064149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:45,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:45,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:45:45,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239839530] [2024-10-12 23:45:45,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:45,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:45,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:45,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:45,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:45,276 INFO L87 Difference]: Start difference. First operand 196 states and 285 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:45,300 INFO L93 Difference]: Finished difference Result 325 states and 473 transitions. [2024-10-12 23:45:45,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:45,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-12 23:45:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:45,301 INFO L225 Difference]: With dead ends: 325 [2024-10-12 23:45:45,301 INFO L226 Difference]: Without dead ends: 198 [2024-10-12 23:45:45,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:45,302 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:45,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-12 23:45:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-10-12 23:45:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.4568527918781726) internal successors, (287), 197 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 287 transitions. [2024-10-12 23:45:45,307 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 287 transitions. Word has length 58 [2024-10-12 23:45:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:45,307 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 287 transitions. [2024-10-12 23:45:45,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,307 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 287 transitions. [2024-10-12 23:45:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 23:45:45,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:45,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:45,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 23:45:45,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:45,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash 801875681, now seen corresponding path program 1 times [2024-10-12 23:45:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:45,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189478467] [2024-10-12 23:45:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189478467] [2024-10-12 23:45:45,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189478467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:45,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:45,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:45:45,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201356555] [2024-10-12 23:45:45,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:45,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:45,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:45,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:45,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:45,418 INFO L87 Difference]: Start difference. First operand 198 states and 287 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:45,444 INFO L93 Difference]: Finished difference Result 329 states and 477 transitions. [2024-10-12 23:45:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:45,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-10-12 23:45:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:45,445 INFO L225 Difference]: With dead ends: 329 [2024-10-12 23:45:45,445 INFO L226 Difference]: Without dead ends: 200 [2024-10-12 23:45:45,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:45,446 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:45,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1031 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-12 23:45:45,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2024-10-12 23:45:45,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4522613065326633) internal successors, (289), 199 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 289 transitions. [2024-10-12 23:45:45,449 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 289 transitions. Word has length 59 [2024-10-12 23:45:45,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:45,449 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 289 transitions. [2024-10-12 23:45:45,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 289 transitions. [2024-10-12 23:45:45,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 23:45:45,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:45,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:45,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 23:45:45,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:45,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:45,450 INFO L85 PathProgramCache]: Analyzing trace with hash 451860200, now seen corresponding path program 1 times [2024-10-12 23:45:45,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:45,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560603585] [2024-10-12 23:45:45,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:45,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:45,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:45,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560603585] [2024-10-12 23:45:45,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560603585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:45,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:45,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:45:45,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053716930] [2024-10-12 23:45:45,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:45,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:45:45,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:45,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:45:45,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:45,541 INFO L87 Difference]: Start difference. First operand 200 states and 289 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:45,562 INFO L93 Difference]: Finished difference Result 333 states and 481 transitions. [2024-10-12 23:45:45,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:45,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-12 23:45:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:45,564 INFO L225 Difference]: With dead ends: 333 [2024-10-12 23:45:45,564 INFO L226 Difference]: Without dead ends: 202 [2024-10-12 23:45:45,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:45,564 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:45,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-12 23:45:45,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-10-12 23:45:45,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 201 states have (on average 1.4477611940298507) internal successors, (291), 201 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 291 transitions. [2024-10-12 23:45:45,568 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 291 transitions. Word has length 60 [2024-10-12 23:45:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:45,568 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 291 transitions. [2024-10-12 23:45:45,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 291 transitions. [2024-10-12 23:45:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 23:45:45,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:45,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:45,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 23:45:45,569 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:45,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash -185160934, now seen corresponding path program 1 times [2024-10-12 23:45:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:45,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633956391] [2024-10-12 23:45:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:45,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:45,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633956391] [2024-10-12 23:45:45,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633956391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:45,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:45,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:45:45,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228411019] [2024-10-12 23:45:45,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:45,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:45:45,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:45,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:45:45,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:45,695 INFO L87 Difference]: Start difference. First operand 202 states and 291 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:45,717 INFO L93 Difference]: Finished difference Result 337 states and 485 transitions. [2024-10-12 23:45:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:45,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 23:45:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:45,720 INFO L225 Difference]: With dead ends: 337 [2024-10-12 23:45:45,720 INFO L226 Difference]: Without dead ends: 204 [2024-10-12 23:45:45,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:45,721 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:45,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 775 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-12 23:45:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-10-12 23:45:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.4433497536945812) internal successors, (293), 203 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 293 transitions. [2024-10-12 23:45:45,725 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 293 transitions. Word has length 61 [2024-10-12 23:45:45,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:45,725 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 293 transitions. [2024-10-12 23:45:45,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 293 transitions. [2024-10-12 23:45:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 23:45:45,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:45,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:45,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 23:45:45,728 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:45,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash -131214794, now seen corresponding path program 1 times [2024-10-12 23:45:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:45,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211959564] [2024-10-12 23:45:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:45,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211959564] [2024-10-12 23:45:45,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211959564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:45,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:45,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:45:45,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518957075] [2024-10-12 23:45:45,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:45,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:45:45,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:45,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:45:45,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:45,868 INFO L87 Difference]: Start difference. First operand 204 states and 293 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:46,008 INFO L93 Difference]: Finished difference Result 389 states and 553 transitions. [2024-10-12 23:45:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:46,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-10-12 23:45:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:46,009 INFO L225 Difference]: With dead ends: 389 [2024-10-12 23:45:46,010 INFO L226 Difference]: Without dead ends: 254 [2024-10-12 23:45:46,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:45:46,010 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 378 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:46,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1010 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-10-12 23:45:46,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 209. [2024-10-12 23:45:46,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.4423076923076923) internal successors, (300), 208 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 300 transitions. [2024-10-12 23:45:46,016 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 300 transitions. Word has length 61 [2024-10-12 23:45:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:46,017 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 300 transitions. [2024-10-12 23:45:46,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 300 transitions. [2024-10-12 23:45:46,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 23:45:46,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:46,018 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:46,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 23:45:46,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:46,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1642520087, now seen corresponding path program 1 times [2024-10-12 23:45:46,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:46,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185747540] [2024-10-12 23:45:46,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:46,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 23:45:46,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:46,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185747540] [2024-10-12 23:45:46,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185747540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:46,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:46,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:45:46,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006470689] [2024-10-12 23:45:46,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:46,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:46,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:46,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:46,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:46,499 INFO L87 Difference]: Start difference. First operand 209 states and 300 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:46,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:46,527 INFO L93 Difference]: Finished difference Result 346 states and 496 transitions. [2024-10-12 23:45:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:46,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 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 123 [2024-10-12 23:45:46,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:46,528 INFO L225 Difference]: With dead ends: 346 [2024-10-12 23:45:46,528 INFO L226 Difference]: Without dead ends: 211 [2024-10-12 23:45:46,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:46,529 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:46,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1034 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-12 23:45:46,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-10-12 23:45:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.438095238095238) internal successors, (302), 210 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 302 transitions. [2024-10-12 23:45:46,535 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 302 transitions. Word has length 123 [2024-10-12 23:45:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:46,535 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 302 transitions. [2024-10-12 23:45:46,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 302 transitions. [2024-10-12 23:45:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 23:45:46,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:46,536 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:46,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 23:45:46,536 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:46,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:46,536 INFO L85 PathProgramCache]: Analyzing trace with hash 360165081, now seen corresponding path program 1 times [2024-10-12 23:45:46,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:46,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179325002] [2024-10-12 23:45:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:46,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 23:45:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:46,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179325002] [2024-10-12 23:45:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179325002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:46,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:46,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:45:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579985897] [2024-10-12 23:45:46,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:46,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:46,891 INFO L87 Difference]: Start difference. First operand 211 states and 302 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:46,926 INFO L93 Difference]: Finished difference Result 350 states and 500 transitions. [2024-10-12 23:45:46,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 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 124 [2024-10-12 23:45:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:46,928 INFO L225 Difference]: With dead ends: 350 [2024-10-12 23:45:46,929 INFO L226 Difference]: Without dead ends: 213 [2024-10-12 23:45:46,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:46,929 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:46,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 776 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-12 23:45:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-10-12 23:45:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.4339622641509433) internal successors, (304), 212 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 304 transitions. [2024-10-12 23:45:46,934 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 304 transitions. Word has length 124 [2024-10-12 23:45:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:46,935 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 304 transitions. [2024-10-12 23:45:46,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 304 transitions. [2024-10-12 23:45:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 23:45:46,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:46,937 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:46,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 23:45:46,937 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:46,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash 10580144, now seen corresponding path program 1 times [2024-10-12 23:45:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:46,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887904948] [2024-10-12 23:45:46,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:46,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:47,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:47,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887904948] [2024-10-12 23:45:47,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887904948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:47,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:47,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 23:45:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226586333] [2024-10-12 23:45:47,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:47,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 23:45:47,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:47,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 23:45:47,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 23:45:47,720 INFO L87 Difference]: Start difference. First operand 213 states and 304 transitions. Second operand has 8 states, 8 states have (on average 15.625) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:47,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:47,810 INFO L93 Difference]: Finished difference Result 360 states and 513 transitions. [2024-10-12 23:45:47,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 23:45:47,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-10-12 23:45:47,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:47,812 INFO L225 Difference]: With dead ends: 360 [2024-10-12 23:45:47,812 INFO L226 Difference]: Without dead ends: 221 [2024-10-12 23:45:47,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-12 23:45:47,812 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 220 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:47,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1236 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-12 23:45:47,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2024-10-12 23:45:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.423963133640553) internal successors, (309), 217 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 309 transitions. [2024-10-12 23:45:47,817 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 309 transitions. Word has length 125 [2024-10-12 23:45:47,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:47,817 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 309 transitions. [2024-10-12 23:45:47,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.625) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 309 transitions. [2024-10-12 23:45:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 23:45:47,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:47,819 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:47,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 23:45:47,819 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:47,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:47,819 INFO L85 PathProgramCache]: Analyzing trace with hash -622209794, now seen corresponding path program 1 times [2024-10-12 23:45:47,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:47,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411876663] [2024-10-12 23:45:47,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:47,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:48,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:48,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411876663] [2024-10-12 23:45:48,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411876663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:48,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:48,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:45:48,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032528953] [2024-10-12 23:45:48,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:48,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:48,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:48,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:48,109 INFO L87 Difference]: Start difference. First operand 218 states and 309 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:48,149 INFO L93 Difference]: Finished difference Result 396 states and 554 transitions. [2024-10-12 23:45:48,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 23:45:48,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 23:45:48,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:48,150 INFO L225 Difference]: With dead ends: 396 [2024-10-12 23:45:48,150 INFO L226 Difference]: Without dead ends: 252 [2024-10-12 23:45:48,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:45:48,151 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 318 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:48,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 753 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-12 23:45:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2024-10-12 23:45:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 1.3944223107569722) internal successors, (350), 251 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 350 transitions. [2024-10-12 23:45:48,157 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 350 transitions. Word has length 126 [2024-10-12 23:45:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:48,157 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 350 transitions. [2024-10-12 23:45:48,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 350 transitions. [2024-10-12 23:45:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 23:45:48,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:48,158 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:48,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 23:45:48,159 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:48,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1688070665, now seen corresponding path program 1 times [2024-10-12 23:45:48,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:48,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171027284] [2024-10-12 23:45:48,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:48,463 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:48,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:48,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171027284] [2024-10-12 23:45:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171027284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:48,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:48,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:48,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888123947] [2024-10-12 23:45:48,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:48,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:45:48,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:48,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:45:48,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:48,468 INFO L87 Difference]: Start difference. First operand 252 states and 350 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:48,643 INFO L93 Difference]: Finished difference Result 528 states and 738 transitions. [2024-10-12 23:45:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 23:45:48,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 23:45:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:48,644 INFO L225 Difference]: With dead ends: 528 [2024-10-12 23:45:48,644 INFO L226 Difference]: Without dead ends: 256 [2024-10-12 23:45:48,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-12 23:45:48,645 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 99 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:48,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1392 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-12 23:45:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2024-10-12 23:45:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.391304347826087) internal successors, (352), 253 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 352 transitions. [2024-10-12 23:45:48,650 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 352 transitions. Word has length 126 [2024-10-12 23:45:48,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:48,650 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 352 transitions. [2024-10-12 23:45:48,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:48,650 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 352 transitions. [2024-10-12 23:45:48,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 23:45:48,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:48,651 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:45:48,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 23:45:48,653 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:48,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash 369902793, now seen corresponding path program 1 times [2024-10-12 23:45:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:48,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606574561] [2024-10-12 23:45:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:49,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606574561] [2024-10-12 23:45:49,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606574561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:49,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:49,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:49,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083296955] [2024-10-12 23:45:49,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:49,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:45:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:45:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 23:45:49,293 INFO L87 Difference]: Start difference. First operand 254 states and 352 transitions. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:49,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:49,383 INFO L93 Difference]: Finished difference Result 442 states and 611 transitions. [2024-10-12 23:45:49,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:45:49,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-10-12 23:45:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:49,386 INFO L225 Difference]: With dead ends: 442 [2024-10-12 23:45:49,386 INFO L226 Difference]: Without dead ends: 296 [2024-10-12 23:45:49,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:45:49,387 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 391 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:49,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1249 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-12 23:45:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 282. [2024-10-12 23:45:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.3772241992882561) internal successors, (387), 281 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:49,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 387 transitions. [2024-10-12 23:45:49,392 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 387 transitions. Word has length 127 [2024-10-12 23:45:49,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:49,392 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 387 transitions. [2024-10-12 23:45:49,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 387 transitions. [2024-10-12 23:45:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 23:45:49,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:49,393 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:49,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 23:45:49,393 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:49,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1372689840, now seen corresponding path program 1 times [2024-10-12 23:45:49,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:49,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809346951] [2024-10-12 23:45:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:49,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:49,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809346951] [2024-10-12 23:45:49,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809346951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:49,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:49,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 23:45:49,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142793501] [2024-10-12 23:45:49,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:49,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 23:45:49,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:49,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 23:45:49,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:49,809 INFO L87 Difference]: Start difference. First operand 282 states and 387 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:50,027 INFO L93 Difference]: Finished difference Result 432 states and 597 transitions. [2024-10-12 23:45:50,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 23:45:50,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-10-12 23:45:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:50,029 INFO L225 Difference]: With dead ends: 432 [2024-10-12 23:45:50,029 INFO L226 Difference]: Without dead ends: 286 [2024-10-12 23:45:50,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:50,030 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 261 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:50,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 687 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 23:45:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-12 23:45:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2024-10-12 23:45:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.3745583038869258) internal successors, (389), 283 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 389 transitions. [2024-10-12 23:45:50,035 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 389 transitions. Word has length 128 [2024-10-12 23:45:50,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:50,036 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 389 transitions. [2024-10-12 23:45:50,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 389 transitions. [2024-10-12 23:45:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 23:45:50,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:50,037 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:50,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 23:45:50,038 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:50,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:50,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2084595988, now seen corresponding path program 1 times [2024-10-12 23:45:50,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:50,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327452902] [2024-10-12 23:45:50,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:50,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327452902] [2024-10-12 23:45:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327452902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 23:45:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617565127] [2024-10-12 23:45:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:50,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:50,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:50,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:50,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:50,363 INFO L87 Difference]: Start difference. First operand 284 states and 389 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:50,388 INFO L93 Difference]: Finished difference Result 450 states and 619 transitions. [2024-10-12 23:45:50,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-10-12 23:45:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:50,389 INFO L225 Difference]: With dead ends: 450 [2024-10-12 23:45:50,390 INFO L226 Difference]: Without dead ends: 288 [2024-10-12 23:45:50,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:50,391 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:50,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 769 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:45:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-12 23:45:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-12 23:45:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.3693379790940767) internal successors, (393), 287 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 393 transitions. [2024-10-12 23:45:50,395 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 393 transitions. Word has length 128 [2024-10-12 23:45:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:50,395 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 393 transitions. [2024-10-12 23:45:50,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 393 transitions. [2024-10-12 23:45:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 23:45:50,396 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:50,396 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:50,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 23:45:50,397 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:50,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1697836702, now seen corresponding path program 1 times [2024-10-12 23:45:50,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:50,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776158785] [2024-10-12 23:45:50,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:50,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:50,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776158785] [2024-10-12 23:45:50,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776158785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:50,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:50,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:45:50,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062819010] [2024-10-12 23:45:50,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:50,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 23:45:50,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:50,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 23:45:50,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:50,727 INFO L87 Difference]: Start difference. First operand 288 states and 393 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:50,863 INFO L93 Difference]: Finished difference Result 438 states and 601 transitions. [2024-10-12 23:45:50,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:50,864 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-10-12 23:45:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:50,865 INFO L225 Difference]: With dead ends: 438 [2024-10-12 23:45:50,865 INFO L226 Difference]: Without dead ends: 288 [2024-10-12 23:45:50,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-12 23:45:50,866 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 255 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:50,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 341 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:50,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-12 23:45:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-12 23:45:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.3658536585365855) internal successors, (392), 287 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 392 transitions. [2024-10-12 23:45:50,870 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 392 transitions. Word has length 129 [2024-10-12 23:45:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:50,871 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 392 transitions. [2024-10-12 23:45:50,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 392 transitions. [2024-10-12 23:45:50,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 23:45:50,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:50,872 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:50,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 23:45:50,872 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:50,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1216501225, now seen corresponding path program 1 times [2024-10-12 23:45:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070621724] [2024-10-12 23:45:50,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:51,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:51,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070621724] [2024-10-12 23:45:51,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070621724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:51,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:45:51,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:45:51,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090942961] [2024-10-12 23:45:51,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:51,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:45:51,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:51,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:45:51,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:45:51,335 INFO L87 Difference]: Start difference. First operand 288 states and 392 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:51,463 INFO L93 Difference]: Finished difference Result 438 states and 599 transitions. [2024-10-12 23:45:51,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:45:51,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-12 23:45:51,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:51,465 INFO L225 Difference]: With dead ends: 438 [2024-10-12 23:45:51,465 INFO L226 Difference]: Without dead ends: 288 [2024-10-12 23:45:51,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:45:51,466 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 186 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:51,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 341 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:45:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-12 23:45:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-12 23:45:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.362369337979094) internal successors, (391), 287 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 391 transitions. [2024-10-12 23:45:51,470 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 391 transitions. Word has length 130 [2024-10-12 23:45:51,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:51,470 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 391 transitions. [2024-10-12 23:45:51,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:51,470 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 391 transitions. [2024-10-12 23:45:51,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 23:45:51,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:51,471 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:51,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 23:45:51,472 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:51,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:51,472 INFO L85 PathProgramCache]: Analyzing trace with hash -620793505, now seen corresponding path program 1 times [2024-10-12 23:45:51,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:51,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734744515] [2024-10-12 23:45:51,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:51,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:52,530 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:52,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734744515] [2024-10-12 23:45:52,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734744515] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:45:52,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756081281] [2024-10-12 23:45:52,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:52,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:45:52,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:45:52,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:45:52,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 23:45:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:52,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-12 23:45:52,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:45:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:53,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:45:53,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756081281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:53,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 23:45:53,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2024-10-12 23:45:53,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549695226] [2024-10-12 23:45:53,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:53,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 23:45:53,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:53,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 23:45:53,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-12 23:45:53,339 INFO L87 Difference]: Start difference. First operand 288 states and 391 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 6 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-12 23:45:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:53,657 INFO L93 Difference]: Finished difference Result 461 states and 628 transitions. [2024-10-12 23:45:53,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 23:45:53,657 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 6 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-12 23:45:53,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:53,659 INFO L225 Difference]: With dead ends: 461 [2024-10-12 23:45:53,659 INFO L226 Difference]: Without dead ends: 311 [2024-10-12 23:45:53,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2024-10-12 23:45:53,660 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 346 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:53,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 812 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:45:53,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-12 23:45:53,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 307. [2024-10-12 23:45:53,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3594771241830066) internal successors, (416), 306 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2024-10-12 23:45:53,665 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 131 [2024-10-12 23:45:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:53,666 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2024-10-12 23:45:53,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 6 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-12 23:45:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2024-10-12 23:45:53,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 23:45:53,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:53,667 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:53,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 23:45:53,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-12 23:45:53,872 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:53,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash -402523894, now seen corresponding path program 1 times [2024-10-12 23:45:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362283195] [2024-10-12 23:45:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:54,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362283195] [2024-10-12 23:45:54,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362283195] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:45:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112731865] [2024-10-12 23:45:54,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:54,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:45:54,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:45:54,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:45:54,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 23:45:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:54,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-12 23:45:54,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:45:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:55,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:45:55,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112731865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:45:55,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 23:45:55,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 17 [2024-10-12 23:45:55,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960455972] [2024-10-12 23:45:55,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:45:55,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 23:45:55,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:45:55,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 23:45:55,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-12 23:45:55,356 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 10 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:45:55,813 INFO L93 Difference]: Finished difference Result 495 states and 672 transitions. [2024-10-12 23:45:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 23:45:55,814 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 10 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2024-10-12 23:45:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:45:55,815 INFO L225 Difference]: With dead ends: 495 [2024-10-12 23:45:55,815 INFO L226 Difference]: Without dead ends: 325 [2024-10-12 23:45:55,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2024-10-12 23:45:55,816 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 238 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:45:55,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1475 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:45:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-12 23:45:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 316. [2024-10-12 23:45:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 1.3523809523809525) internal successors, (426), 315 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 426 transitions. [2024-10-12 23:45:55,820 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 426 transitions. Word has length 132 [2024-10-12 23:45:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:45:55,820 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 426 transitions. [2024-10-12 23:45:55,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 10 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:45:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 426 transitions. [2024-10-12 23:45:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 23:45:55,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:45:55,821 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 23:45:55,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 23:45:56,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-12 23:45:56,026 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:45:56,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:45:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash -648229089, now seen corresponding path program 1 times [2024-10-12 23:45:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:45:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553787292] [2024-10-12 23:45:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:45:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:56,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:45:56,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553787292] [2024-10-12 23:45:56,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553787292] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 23:45:56,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61320153] [2024-10-12 23:45:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:45:56,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:45:56,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:45:56,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:45:56,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 23:45:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:45:56,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 129 conjuncts are in the unsatisfiable core [2024-10-12 23:45:56,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:45:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:45:58,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 23:46:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 23:46:01,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61320153] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 23:46:01,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 23:46:01,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 25, 28] total 56 [2024-10-12 23:46:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199403627] [2024-10-12 23:46:01,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 23:46:01,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-10-12 23:46:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:46:01,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-10-12 23:46:01,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2942, Unknown=0, NotChecked=0, Total=3192 [2024-10-12 23:46:01,048 INFO L87 Difference]: Start difference. First operand 316 states and 426 transitions. Second operand has 57 states, 57 states have (on average 6.7894736842105265) internal successors, (387), 56 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:46:06,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:46:06,607 INFO L93 Difference]: Finished difference Result 686 states and 924 transitions. [2024-10-12 23:46:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-12 23:46:06,607 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 6.7894736842105265) internal successors, (387), 56 states have internal predecessors, (387), 0 states have call successors, (0), 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 133 [2024-10-12 23:46:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:46:06,608 INFO L225 Difference]: With dead ends: 686 [2024-10-12 23:46:06,608 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 23:46:06,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2275 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=980, Invalid=11676, Unknown=0, NotChecked=0, Total=12656 [2024-10-12 23:46:06,611 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 1298 mSDsluCounter, 6119 mSDsCounter, 0 mSdLazyCounter, 5701 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 6293 SdHoareTripleChecker+Invalid, 5724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-12 23:46:06,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 6293 Invalid, 5724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5701 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-12 23:46:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 23:46:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 23:46:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:46:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 23:46:06,612 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2024-10-12 23:46:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:46:06,612 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 23:46:06,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 6.7894736842105265) internal successors, (387), 56 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 23:46:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 23:46:06,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 23:46:06,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:46:06,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 23:46:06,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:46:06,819 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-12 23:46:06,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 23:46:06,888 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:46:06,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:46:06 BoogieIcfgContainer [2024-10-12 23:46:06,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:46:06,902 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:46:06,902 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:46:06,902 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:46:06,903 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:45:42" (3/4) ... [2024-10-12 23:46:06,904 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 23:46:06,920 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-12 23:46:06,920 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-12 23:46:06,925 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 23:46:06,925 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 23:46:06,926 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 23:46:07,105 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 23:46:07,106 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 23:46:07,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:46:07,106 INFO L158 Benchmark]: Toolchain (without parser) took 26027.44ms. Allocated memory was 197.1MB in the beginning and 1.1GB in the end (delta: 876.6MB). Free memory was 128.8MB in the beginning and 782.2MB in the end (delta: -653.3MB). Peak memory consumption was 223.2MB. Max. memory is 16.1GB. [2024-10-12 23:46:07,108 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:46:07,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.12ms. Allocated memory is still 197.1MB. Free memory was 128.8MB in the beginning and 144.6MB in the end (delta: -15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 23:46:07,108 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.52ms. Allocated memory is still 197.1MB. Free memory was 144.6MB in the beginning and 128.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 23:46:07,109 INFO L158 Benchmark]: Boogie Preprocessor took 143.73ms. Allocated memory is still 197.1MB. Free memory was 128.8MB in the beginning and 118.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 23:46:07,109 INFO L158 Benchmark]: RCFGBuilder took 957.71ms. Allocated memory was 197.1MB in the beginning and 299.9MB in the end (delta: 102.8MB). Free memory was 118.3MB in the beginning and 213.4MB in the end (delta: -95.0MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2024-10-12 23:46:07,109 INFO L158 Benchmark]: TraceAbstraction took 24176.03ms. Allocated memory was 299.9MB in the beginning and 1.1GB in the end (delta: 773.8MB). Free memory was 213.4MB in the beginning and 795.8MB in the end (delta: -582.5MB). Peak memory consumption was 191.4MB. Max. memory is 16.1GB. [2024-10-12 23:46:07,109 INFO L158 Benchmark]: Witness Printer took 203.81ms. Allocated memory is still 1.1GB. Free memory was 795.8MB in the beginning and 782.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 23:46:07,111 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.12ms. Allocated memory is still 197.1MB. Free memory was 128.8MB in the beginning and 144.6MB in the end (delta: -15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.52ms. Allocated memory is still 197.1MB. Free memory was 144.6MB in the beginning and 128.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 143.73ms. Allocated memory is still 197.1MB. Free memory was 128.8MB in the beginning and 118.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 957.71ms. Allocated memory was 197.1MB in the beginning and 299.9MB in the end (delta: 102.8MB). Free memory was 118.3MB in the beginning and 213.4MB in the end (delta: -95.0MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. * TraceAbstraction took 24176.03ms. Allocated memory was 299.9MB in the beginning and 1.1GB in the end (delta: 773.8MB). Free memory was 213.4MB in the beginning and 795.8MB in the end (delta: -582.5MB). Peak memory consumption was 191.4MB. Max. memory is 16.1GB. * Witness Printer took 203.81ms. Allocated memory is still 1.1GB. Free memory was 795.8MB in the beginning and 782.2MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 179 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5219 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5219 mSDsluCounter, 26918 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21218 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8583 IncrementalHoareTripleChecker+Invalid, 8629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 5700 mSDtfsCounter, 8583 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 758 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2407 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=23, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 251 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 2684 NumberOfCodeBlocks, 2684 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2789 ConstructedInterpolants, 0 QuantifiedInterpolants, 13364 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2451 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 28 InterpolantComputations, 23 PerfectInterpolantSequences, 327/405 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((var_5 == 0) && (var_13 == 1)) && (mask_SORT_1 == 0)) || (((((var_114 == 1) && (var_5 == 0)) && ((((short) state_14 + 1) % 256) <= 0)) && (var_13 == 1)) && (mask_SORT_1 == 1))) || (((((((((((state_18 == 0) && (var_114 == 1)) && (state_29 == 0)) && (var_5 == 0)) && (((255 + ((unsigned short) state_33 * 255)) % 256) != 0)) && (state_22 == 0)) && (var_13 == 1)) && (state_6 == 0)) && (mask_SORT_1 == 1)) && (state_14 == 1)) && (state_9 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-12 23:46:07,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE