./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.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 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:14:47,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:14:47,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 19:14:47,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:14:47,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:14:47,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:14:47,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:14:47,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:14:47,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:14:47,679 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:14:47,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:14:47,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:14:47,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:14:47,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:14:47,680 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:14:47,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:14:47,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:14:47,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:14:47,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:14:47,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:14:47,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:14:47,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:14:47,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:14:47,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:14:47,684 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:14:47,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:14:47,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:14:47,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:14:47,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:14:47,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:14:47,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:14:47,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:14:47,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:14:47,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:14:47,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:14:47,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:14:47,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:14:47,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:14:47,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:14:47,686 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 -> 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c [2024-11-08 19:14:47,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:14:47,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:14:47,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:14:47,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:14:47,953 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:14:47,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-11-08 19:14:49,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:14:49,292 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:14:49,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-11-08 19:14:49,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ac2fa2c/e903deabecaa4f0a9fbe9573c70df771/FLAG2362af928 [2024-11-08 19:14:49,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4ac2fa2c/e903deabecaa4f0a9fbe9573c70df771 [2024-11-08 19:14:49,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:14:49,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:14:49,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:14:49,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:14:49,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:14:49,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:14:49" (1/1) ... [2024-11-08 19:14:49,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c586d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:49, skipping insertion in model container [2024-11-08 19:14:49,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:14:49" (1/1) ... [2024-11-08 19:14:49,743 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:14:49,872 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-11-08 19:14:49,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:14:49,961 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:14:49,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-11-08 19:14:50,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:14:50,022 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:14:50,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50 WrapperNode [2024-11-08 19:14:50,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:14:50,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:14:50,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:14:50,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:14:50,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,085 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 484 [2024-11-08 19:14:50,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:14:50,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:14:50,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:14:50,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:14:50,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,144 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:14:50,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:14:50,191 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:14:50,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:14:50,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:14:50,192 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (1/1) ... [2024-11-08 19:14:50,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:14:50,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:14:50,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:14:50,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:14:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:14:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:14:50,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:14:50,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:14:50,371 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:14:50,373 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:14:50,879 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2024-11-08 19:14:50,879 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:14:50,894 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:14:50,894 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:14:50,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:14:50 BoogieIcfgContainer [2024-11-08 19:14:50,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:14:50,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:14:50,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:14:50,899 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:14:50,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:14:49" (1/3) ... [2024-11-08 19:14:50,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9f29c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:14:50, skipping insertion in model container [2024-11-08 19:14:50,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:14:50" (2/3) ... [2024-11-08 19:14:50,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9f29c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:14:50, skipping insertion in model container [2024-11-08 19:14:50,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:14:50" (3/3) ... [2024-11-08 19:14:50,901 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-11-08 19:14:50,913 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:14:50,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:14:50,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:14:50,962 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;@364a6a81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:14:50,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:14:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.4919354838709677) internal successors, (185), 125 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 19:14:50,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:50,973 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] [2024-11-08 19:14:50,973 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:50,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1135438275, now seen corresponding path program 1 times [2024-11-08 19:14:50,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:50,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358735411] [2024-11-08 19:14:50,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:50,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:51,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:51,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358735411] [2024-11-08 19:14:51,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358735411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:51,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:14:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673708253] [2024-11-08 19:14:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:51,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:14:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:51,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:14:51,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:14:51,458 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.4919354838709677) internal successors, (185), 125 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:51,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:51,503 INFO L93 Difference]: Finished difference Result 233 states and 345 transitions. [2024-11-08 19:14:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:14:51,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-08 19:14:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:51,512 INFO L225 Difference]: With dead ends: 233 [2024-11-08 19:14:51,512 INFO L226 Difference]: Without dead ends: 125 [2024-11-08 19:14:51,514 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-11-08 19:14:51,517 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:51,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:14:51,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-08 19:14:51,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-08 19:14:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.4758064516129032) internal successors, (183), 124 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 183 transitions. [2024-11-08 19:14:51,543 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 183 transitions. Word has length 23 [2024-11-08 19:14:51,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:51,543 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 183 transitions. [2024-11-08 19:14:51,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 183 transitions. [2024-11-08 19:14:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 19:14:51,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:51,544 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] [2024-11-08 19:14:51,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:14:51,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash 840543427, now seen corresponding path program 1 times [2024-11-08 19:14:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:51,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756859947] [2024-11-08 19:14:51,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:51,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:51,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756859947] [2024-11-08 19:14:51,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756859947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:51,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:51,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:14:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748240969] [2024-11-08 19:14:51,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:51,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:14:51,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:51,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:14:51,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:14:51,665 INFO L87 Difference]: Start difference. First operand 125 states and 183 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:51,699 INFO L93 Difference]: Finished difference Result 234 states and 343 transitions. [2024-11-08 19:14:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:14:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2024-11-08 19:14:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:51,702 INFO L225 Difference]: With dead ends: 234 [2024-11-08 19:14:51,702 INFO L226 Difference]: Without dead ends: 127 [2024-11-08 19:14:51,703 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-11-08 19:14:51,703 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:51,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:14:51,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-08 19:14:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-08 19:14:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.4682539682539681) internal successors, (185), 126 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-11-08 19:14:51,713 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 24 [2024-11-08 19:14:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:51,713 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-11-08 19:14:51,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-11-08 19:14:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 19:14:51,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:51,714 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] [2024-11-08 19:14:51,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:14:51,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:51,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:51,715 INFO L85 PathProgramCache]: Analyzing trace with hash -810923364, now seen corresponding path program 1 times [2024-11-08 19:14:51,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:51,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791822555] [2024-11-08 19:14:51,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:51,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:51,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:51,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791822555] [2024-11-08 19:14:51,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791822555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:51,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:51,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:14:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076774307] [2024-11-08 19:14:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:51,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:14:51,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:51,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:14:51,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:14:51,944 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:52,010 INFO L93 Difference]: Finished difference Result 250 states and 365 transitions. [2024-11-08 19:14:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:14:52,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-08 19:14:52,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:52,013 INFO L225 Difference]: With dead ends: 250 [2024-11-08 19:14:52,013 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 19:14:52,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:14:52,016 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 26 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:52,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1001 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:14:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 19:14:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2024-11-08 19:14:52,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.460431654676259) internal successors, (203), 139 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2024-11-08 19:14:52,025 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 25 [2024-11-08 19:14:52,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:52,025 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2024-11-08 19:14:52,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2024-11-08 19:14:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 19:14:52,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:52,026 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] [2024-11-08 19:14:52,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:14:52,026 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:52,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:52,027 INFO L85 PathProgramCache]: Analyzing trace with hash 816764857, now seen corresponding path program 1 times [2024-11-08 19:14:52,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:52,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481438375] [2024-11-08 19:14:52,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:52,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:52,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481438375] [2024-11-08 19:14:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481438375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:52,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:52,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 19:14:52,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420143198] [2024-11-08 19:14:52,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:52,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:14:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:52,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:14:52,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:14:52,481 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:52,575 INFO L93 Difference]: Finished difference Result 256 states and 371 transitions. [2024-11-08 19:14:52,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:14:52,575 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2024-11-08 19:14:52,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:52,576 INFO L225 Difference]: With dead ends: 256 [2024-11-08 19:14:52,576 INFO L226 Difference]: Without dead ends: 141 [2024-11-08 19:14:52,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:14:52,577 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 25 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:52,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1334 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:14:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-08 19:14:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-08 19:14:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.45) internal successors, (203), 140 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 203 transitions. [2024-11-08 19:14:52,587 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 203 transitions. Word has length 27 [2024-11-08 19:14:52,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:52,588 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 203 transitions. [2024-11-08 19:14:52,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,588 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 203 transitions. [2024-11-08 19:14:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 19:14:52,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:52,591 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] [2024-11-08 19:14:52,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:14:52,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:52,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1260296434, now seen corresponding path program 1 times [2024-11-08 19:14:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599260505] [2024-11-08 19:14:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599260505] [2024-11-08 19:14:52,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599260505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:52,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:52,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:14:52,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756738830] [2024-11-08 19:14:52,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:52,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:14:52,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:52,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:14:52,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:14:52,711 INFO L87 Difference]: Start difference. First operand 141 states and 203 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:52,784 INFO L93 Difference]: Finished difference Result 320 states and 459 transitions. [2024-11-08 19:14:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:14:52,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-08 19:14:52,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:52,786 INFO L225 Difference]: With dead ends: 320 [2024-11-08 19:14:52,786 INFO L226 Difference]: Without dead ends: 200 [2024-11-08 19:14:52,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:14:52,787 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 108 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:52,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 982 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:14:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-08 19:14:52,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 142. [2024-11-08 19:14:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.4397163120567376) internal successors, (203), 141 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 203 transitions. [2024-11-08 19:14:52,802 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 203 transitions. Word has length 28 [2024-11-08 19:14:52,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:52,802 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 203 transitions. [2024-11-08 19:14:52,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,803 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 203 transitions. [2024-11-08 19:14:52,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 19:14:52,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:52,804 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] [2024-11-08 19:14:52,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:14:52,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:52,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash -2085566478, now seen corresponding path program 1 times [2024-11-08 19:14:52,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:52,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531653759] [2024-11-08 19:14:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:52,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:52,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531653759] [2024-11-08 19:14:52,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531653759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:52,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:52,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:14:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978024903] [2024-11-08 19:14:52,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:52,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:14:52,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:52,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:14:52,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:14:52,872 INFO L87 Difference]: Start difference. First operand 142 states and 203 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:52,902 INFO L93 Difference]: Finished difference Result 312 states and 449 transitions. [2024-11-08 19:14:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:14:52,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2024-11-08 19:14:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:52,903 INFO L225 Difference]: With dead ends: 312 [2024-11-08 19:14:52,903 INFO L226 Difference]: Without dead ends: 192 [2024-11-08 19:14:52,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:14:52,904 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 106 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:52,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 670 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:14:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-08 19:14:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135. [2024-11-08 19:14:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 134 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2024-11-08 19:14:52,914 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 29 [2024-11-08 19:14:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:52,914 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2024-11-08 19:14:52,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2024-11-08 19:14:52,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 19:14:52,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:52,917 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:52,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:14:52,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:52,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:52,918 INFO L85 PathProgramCache]: Analyzing trace with hash -905939236, now seen corresponding path program 1 times [2024-11-08 19:14:52,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:52,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421977526] [2024-11-08 19:14:52,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:52,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:53,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421977526] [2024-11-08 19:14:53,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421977526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:53,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:53,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:14:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442222978] [2024-11-08 19:14:53,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:53,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:14:53,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:53,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:14:53,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:14:53,298 INFO L87 Difference]: Start difference. First operand 135 states and 193 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:53,366 INFO L93 Difference]: Finished difference Result 304 states and 440 transitions. [2024-11-08 19:14:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:14:53,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2024-11-08 19:14:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:53,368 INFO L225 Difference]: With dead ends: 304 [2024-11-08 19:14:53,368 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 19:14:53,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:14:53,370 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 110 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:53,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1003 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:14:53,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 19:14:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 152. [2024-11-08 19:14:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.423841059602649) internal successors, (215), 151 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 215 transitions. [2024-11-08 19:14:53,375 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 215 transitions. Word has length 78 [2024-11-08 19:14:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:53,375 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 215 transitions. [2024-11-08 19:14:53,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 215 transitions. [2024-11-08 19:14:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-08 19:14:53,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:53,382 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:53,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:14:53,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:53,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1704986318, now seen corresponding path program 1 times [2024-11-08 19:14:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:53,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010713096] [2024-11-08 19:14:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:53,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:53,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010713096] [2024-11-08 19:14:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010713096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:53,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:53,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:14:53,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660820669] [2024-11-08 19:14:53,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:53,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:14:53,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:53,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:14:53,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:14:53,843 INFO L87 Difference]: Start difference. First operand 152 states and 215 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:53,960 INFO L93 Difference]: Finished difference Result 320 states and 462 transitions. [2024-11-08 19:14:53,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:14:53,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2024-11-08 19:14:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:53,961 INFO L225 Difference]: With dead ends: 320 [2024-11-08 19:14:53,961 INFO L226 Difference]: Without dead ends: 211 [2024-11-08 19:14:53,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:14:53,962 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 111 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:53,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1293 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:14:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-08 19:14:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 170. [2024-11-08 19:14:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.4201183431952662) internal successors, (240), 169 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2024-11-08 19:14:53,966 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 79 [2024-11-08 19:14:53,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:53,966 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2024-11-08 19:14:53,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2024-11-08 19:14:53,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-08 19:14:53,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:53,968 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:53,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 19:14:53,968 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:53,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1936749128, now seen corresponding path program 1 times [2024-11-08 19:14:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:53,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060916576] [2024-11-08 19:14:53,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:53,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:54,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:54,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:54,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060916576] [2024-11-08 19:14:54,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060916576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:54,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:54,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 19:14:54,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90251908] [2024-11-08 19:14:54,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:54,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:14:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:54,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:14:54,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:14:54,445 INFO L87 Difference]: Start difference. First operand 170 states and 240 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:54,599 INFO L93 Difference]: Finished difference Result 411 states and 592 transitions. [2024-11-08 19:14:54,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 19:14:54,599 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2024-11-08 19:14:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:54,600 INFO L225 Difference]: With dead ends: 411 [2024-11-08 19:14:54,600 INFO L226 Difference]: Without dead ends: 302 [2024-11-08 19:14:54,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-11-08 19:14:54,601 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 171 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 2262 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:54,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 2262 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:14:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-08 19:14:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 211. [2024-11-08 19:14:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4285714285714286) internal successors, (300), 210 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-11-08 19:14:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 300 transitions. [2024-11-08 19:14:54,611 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 300 transitions. Word has length 80 [2024-11-08 19:14:54,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:54,611 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 300 transitions. [2024-11-08 19:14:54,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:54,611 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 300 transitions. [2024-11-08 19:14:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 19:14:54,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:54,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:54,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 19:14:54,614 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:54,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:54,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1144376213, now seen corresponding path program 1 times [2024-11-08 19:14:54,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:54,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904470560] [2024-11-08 19:14:54,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:54,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:55,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:55,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904470560] [2024-11-08 19:14:55,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904470560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:55,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:55,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:14:55,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640376242] [2024-11-08 19:14:55,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:55,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:14:55,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:55,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:14:55,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:14:55,005 INFO L87 Difference]: Start difference. First operand 211 states and 300 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:55,018 INFO L93 Difference]: Finished difference Result 361 states and 519 transitions. [2024-11-08 19:14:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:14:55,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2024-11-08 19:14:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:55,019 INFO L225 Difference]: With dead ends: 361 [2024-11-08 19:14:55,019 INFO L226 Difference]: Without dead ends: 211 [2024-11-08 19:14:55,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:14:55,020 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 2 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:55,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:14:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-08 19:14:55,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-11-08 19:14:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.4238095238095239) internal successors, (299), 210 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2024-11-08 19:14:55,024 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 81 [2024-11-08 19:14:55,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:55,024 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2024-11-08 19:14:55,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2024-11-08 19:14:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-08 19:14:55,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:55,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 19:14:55,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:55,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:55,025 INFO L85 PathProgramCache]: Analyzing trace with hash 905973268, now seen corresponding path program 1 times [2024-11-08 19:14:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682792715] [2024-11-08 19:14:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:55,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:55,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682792715] [2024-11-08 19:14:55,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682792715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:55,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 19:14:55,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156108034] [2024-11-08 19:14:55,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:55,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 19:14:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:55,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 19:14:55,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:14:55,792 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:56,004 INFO L93 Difference]: Finished difference Result 440 states and 635 transitions. [2024-11-08 19:14:56,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 19:14:56,005 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2024-11-08 19:14:56,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:56,006 INFO L225 Difference]: With dead ends: 440 [2024-11-08 19:14:56,006 INFO L226 Difference]: Without dead ends: 290 [2024-11-08 19:14:56,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:14:56,007 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 87 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1830 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:56,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1830 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:14:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-08 19:14:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 280. [2024-11-08 19:14:56,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.4229390681003584) internal successors, (397), 279 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 397 transitions. [2024-11-08 19:14:56,012 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 397 transitions. Word has length 82 [2024-11-08 19:14:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:56,013 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 397 transitions. [2024-11-08 19:14:56,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:56,013 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 397 transitions. [2024-11-08 19:14:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 19:14:56,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:56,014 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:56,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 19:14:56,014 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:56,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1706440209, now seen corresponding path program 1 times [2024-11-08 19:14:56,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:56,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330393191] [2024-11-08 19:14:56,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:56,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:56,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:56,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330393191] [2024-11-08 19:14:56,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330393191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:14:56,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440622281] [2024-11-08 19:14:56,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:56,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:14:56,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:14:56,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:14:56,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:14:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:56,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 19:14:56,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:14:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:57,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:14:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:58,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440622281] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:14:58,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:14:58,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 50 [2024-11-08 19:14:58,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064506007] [2024-11-08 19:14:58,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:14:58,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-08 19:14:58,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:58,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-08 19:14:58,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2277, Unknown=0, NotChecked=0, Total=2450 [2024-11-08 19:14:58,566 INFO L87 Difference]: Start difference. First operand 280 states and 397 transitions. Second operand has 50 states, 50 states have (on average 3.88) internal successors, (194), 50 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:59,397 INFO L93 Difference]: Finished difference Result 752 states and 1088 transitions. [2024-11-08 19:14:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-08 19:14:59,398 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.88) internal successors, (194), 50 states have internal predecessors, (194), 0 states have call successors, (0), 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 83 [2024-11-08 19:14:59,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:59,399 INFO L225 Difference]: With dead ends: 752 [2024-11-08 19:14:59,400 INFO L226 Difference]: Without dead ends: 553 [2024-11-08 19:14:59,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=208, Invalid=2762, Unknown=0, NotChecked=0, Total=2970 [2024-11-08 19:14:59,401 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 499 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:59,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 3705 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 19:14:59,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-08 19:14:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 504. [2024-11-08 19:14:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.4393638170974155) internal successors, (724), 503 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 724 transitions. [2024-11-08 19:14:59,408 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 724 transitions. Word has length 83 [2024-11-08 19:14:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:59,409 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 724 transitions. [2024-11-08 19:14:59,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.88) internal successors, (194), 50 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 724 transitions. [2024-11-08 19:14:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-08 19:14:59,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:59,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:59,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:14:59,610 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,SelfDestructingSolverStorable11 [2024-11-08 19:14:59,611 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:59,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:59,611 INFO L85 PathProgramCache]: Analyzing trace with hash -409749209, now seen corresponding path program 1 times [2024-11-08 19:14:59,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:59,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574763494] [2024-11-08 19:14:59,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:59,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:14:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:14:59,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:14:59,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574763494] [2024-11-08 19:14:59,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574763494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:14:59,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:14:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:14:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952156764] [2024-11-08 19:14:59,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:14:59,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:14:59,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:14:59,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:14:59,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:14:59,764 INFO L87 Difference]: Start difference. First operand 504 states and 724 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:14:59,791 INFO L93 Difference]: Finished difference Result 747 states and 1079 transitions. [2024-11-08 19:14:59,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:14:59,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-11-08 19:14:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:14:59,794 INFO L225 Difference]: With dead ends: 747 [2024-11-08 19:14:59,794 INFO L226 Difference]: Without dead ends: 514 [2024-11-08 19:14:59,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:14:59,795 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 65 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:14:59,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 666 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:14:59,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-08 19:14:59,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 504. [2024-11-08 19:14:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 1.4294234592445327) internal successors, (719), 503 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 719 transitions. [2024-11-08 19:14:59,802 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 719 transitions. Word has length 83 [2024-11-08 19:14:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:14:59,802 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 719 transitions. [2024-11-08 19:14:59,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:14:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 719 transitions. [2024-11-08 19:14:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 19:14:59,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:14:59,804 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:14:59,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 19:14:59,804 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:14:59,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:14:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 204506291, now seen corresponding path program 1 times [2024-11-08 19:14:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:14:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780200426] [2024-11-08 19:14:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:14:59,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:14:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:00,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:00,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780200426] [2024-11-08 19:15:00,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780200426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:00,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926771262] [2024-11-08 19:15:00,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:00,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:00,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:00,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:15:00,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 19:15:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:00,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 122 conjuncts are in the unsatisfiable core [2024-11-08 19:15:00,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:01,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:15:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:03,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926771262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:15:03,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:15:03,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28, 25] total 60 [2024-11-08 19:15:03,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78534846] [2024-11-08 19:15:03,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:15:03,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-08 19:15:03,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:03,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-08 19:15:03,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=3232, Unknown=0, NotChecked=0, Total=3540 [2024-11-08 19:15:03,206 INFO L87 Difference]: Start difference. First operand 504 states and 719 transitions. Second operand has 60 states, 60 states have (on average 3.566666666666667) internal successors, (214), 60 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:04,935 INFO L93 Difference]: Finished difference Result 1970 states and 2829 transitions. [2024-11-08 19:15:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-08 19:15:04,936 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 3.566666666666667) internal successors, (214), 60 states have internal predecessors, (214), 0 states have call successors, (0), 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 84 [2024-11-08 19:15:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:04,939 INFO L225 Difference]: With dead ends: 1970 [2024-11-08 19:15:04,940 INFO L226 Difference]: Without dead ends: 1517 [2024-11-08 19:15:04,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1002, Invalid=8700, Unknown=0, NotChecked=0, Total=9702 [2024-11-08 19:15:04,943 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1064 mSDsluCounter, 5770 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1064 SdHoareTripleChecker+Valid, 5971 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:04,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1064 Valid, 5971 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 19:15:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-08 19:15:04,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1177. [2024-11-08 19:15:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1176 states have (on average 1.4226190476190477) internal successors, (1673), 1176 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1673 transitions. [2024-11-08 19:15:04,959 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1673 transitions. Word has length 84 [2024-11-08 19:15:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:04,959 INFO L471 AbstractCegarLoop]: Abstraction has 1177 states and 1673 transitions. [2024-11-08 19:15:04,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 3.566666666666667) internal successors, (214), 60 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1673 transitions. [2024-11-08 19:15:04,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 19:15:04,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:04,961 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:04,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 19:15:05,161 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,SelfDestructingSolverStorable13 [2024-11-08 19:15:05,162 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:05,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:05,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1882507642, now seen corresponding path program 1 times [2024-11-08 19:15:05,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:05,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648456523] [2024-11-08 19:15:05,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:05,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:05,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:05,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648456523] [2024-11-08 19:15:05,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648456523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:05,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:05,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:15:05,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114373091] [2024-11-08 19:15:05,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:05,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:15:05,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:15:05,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:15:05,310 INFO L87 Difference]: Start difference. First operand 1177 states and 1673 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:05,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:05,340 INFO L93 Difference]: Finished difference Result 1664 states and 2374 transitions. [2024-11-08 19:15:05,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:15:05,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-08 19:15:05,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:05,343 INFO L225 Difference]: With dead ends: 1664 [2024-11-08 19:15:05,343 INFO L226 Difference]: Without dead ends: 1163 [2024-11-08 19:15:05,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:15:05,345 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 67 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:05,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 657 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:05,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-08 19:15:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1163. [2024-11-08 19:15:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1162 states have (on average 1.4018932874354562) internal successors, (1629), 1162 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1629 transitions. [2024-11-08 19:15:05,358 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1629 transitions. Word has length 84 [2024-11-08 19:15:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:05,358 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1629 transitions. [2024-11-08 19:15:05,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1629 transitions. [2024-11-08 19:15:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 19:15:05,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:05,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:05,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 19:15:05,361 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:05,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:05,361 INFO L85 PathProgramCache]: Analyzing trace with hash -515539137, now seen corresponding path program 1 times [2024-11-08 19:15:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:05,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979011897] [2024-11-08 19:15:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:05,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:05,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:05,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979011897] [2024-11-08 19:15:05,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979011897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:05,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:05,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 19:15:05,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355220053] [2024-11-08 19:15:05,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:05,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:15:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:05,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:15:05,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 19:15:05,676 INFO L87 Difference]: Start difference. First operand 1163 states and 1629 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:05,794 INFO L93 Difference]: Finished difference Result 1737 states and 2445 transitions. [2024-11-08 19:15:05,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:15:05,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-08 19:15:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:05,798 INFO L225 Difference]: With dead ends: 1737 [2024-11-08 19:15:05,798 INFO L226 Difference]: Without dead ends: 1199 [2024-11-08 19:15:05,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:15:05,799 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 82 mSDsluCounter, 1233 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1393 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:05,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1393 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:05,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-11-08 19:15:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1190. [2024-11-08 19:15:05,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 1.3952901597981497) internal successors, (1659), 1189 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:05,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1659 transitions. [2024-11-08 19:15:05,811 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1659 transitions. Word has length 84 [2024-11-08 19:15:05,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:05,811 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1659 transitions. [2024-11-08 19:15:05,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:05,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1659 transitions. [2024-11-08 19:15:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 19:15:05,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:05,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:05,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 19:15:05,813 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:05,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:05,813 INFO L85 PathProgramCache]: Analyzing trace with hash -123681257, now seen corresponding path program 1 times [2024-11-08 19:15:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:05,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960984879] [2024-11-08 19:15:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:05,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:06,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:06,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960984879] [2024-11-08 19:15:06,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960984879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:06,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 19:15:06,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535079582] [2024-11-08 19:15:06,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:06,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:15:06,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:06,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:15:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:15:06,405 INFO L87 Difference]: Start difference. First operand 1190 states and 1659 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:06,653 INFO L93 Difference]: Finished difference Result 1435 states and 2009 transitions. [2024-11-08 19:15:06,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:15:06,654 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-08 19:15:06,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:06,657 INFO L225 Difference]: With dead ends: 1435 [2024-11-08 19:15:06,657 INFO L226 Difference]: Without dead ends: 1202 [2024-11-08 19:15:06,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-11-08 19:15:06,661 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 146 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:06,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1870 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:06,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2024-11-08 19:15:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1190. [2024-11-08 19:15:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 1189 states have (on average 1.3952901597981497) internal successors, (1659), 1189 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1659 transitions. [2024-11-08 19:15:06,674 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1659 transitions. Word has length 84 [2024-11-08 19:15:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:06,674 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1659 transitions. [2024-11-08 19:15:06,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1659 transitions. [2024-11-08 19:15:06,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 19:15:06,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:06,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:06,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 19:15:06,676 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:06,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:06,677 INFO L85 PathProgramCache]: Analyzing trace with hash -554569480, now seen corresponding path program 1 times [2024-11-08 19:15:06,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:06,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332618693] [2024-11-08 19:15:06,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:06,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:07,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:07,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332618693] [2024-11-08 19:15:07,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332618693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:07,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:07,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 19:15:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272196531] [2024-11-08 19:15:07,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:07,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 19:15:07,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:07,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 19:15:07,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:15:07,333 INFO L87 Difference]: Start difference. First operand 1190 states and 1659 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:07,556 INFO L93 Difference]: Finished difference Result 1479 states and 2073 transitions. [2024-11-08 19:15:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 19:15:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-08 19:15:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:07,559 INFO L225 Difference]: With dead ends: 1479 [2024-11-08 19:15:07,559 INFO L226 Difference]: Without dead ends: 1250 [2024-11-08 19:15:07,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:15:07,560 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 87 mSDsluCounter, 2051 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:07,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 2250 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:07,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-08 19:15:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 930. [2024-11-08 19:15:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 1.3907427341227125) internal successors, (1292), 929 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1292 transitions. [2024-11-08 19:15:07,570 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1292 transitions. Word has length 84 [2024-11-08 19:15:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:07,570 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1292 transitions. [2024-11-08 19:15:07,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1292 transitions. [2024-11-08 19:15:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 19:15:07,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:07,572 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:07,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 19:15:07,572 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:07,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1880524660, now seen corresponding path program 1 times [2024-11-08 19:15:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:07,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631729582] [2024-11-08 19:15:07,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:07,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:07,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:07,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631729582] [2024-11-08 19:15:07,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631729582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:07,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:07,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:15:07,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727677995] [2024-11-08 19:15:07,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:07,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:15:07,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:07,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:15:07,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:15:07,725 INFO L87 Difference]: Start difference. First operand 930 states and 1292 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:07,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:07,756 INFO L93 Difference]: Finished difference Result 1765 states and 2455 transitions. [2024-11-08 19:15:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:15:07,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-11-08 19:15:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:07,758 INFO L225 Difference]: With dead ends: 1765 [2024-11-08 19:15:07,758 INFO L226 Difference]: Without dead ends: 918 [2024-11-08 19:15:07,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:07,759 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 57 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:07,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 823 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-08 19:15:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 918. [2024-11-08 19:15:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 917 states have (on average 1.3849509269356597) internal successors, (1270), 917 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1270 transitions. [2024-11-08 19:15:07,768 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1270 transitions. Word has length 84 [2024-11-08 19:15:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:07,768 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1270 transitions. [2024-11-08 19:15:07,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1270 transitions. [2024-11-08 19:15:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 19:15:07,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:07,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:07,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 19:15:07,770 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:07,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:07,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1414570585, now seen corresponding path program 1 times [2024-11-08 19:15:07,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844885604] [2024-11-08 19:15:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:07,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:08,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:08,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844885604] [2024-11-08 19:15:08,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844885604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:08,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:08,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-08 19:15:08,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039769391] [2024-11-08 19:15:08,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:08,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 19:15:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:08,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 19:15:08,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2024-11-08 19:15:08,613 INFO L87 Difference]: Start difference. First operand 918 states and 1270 transitions. Second operand has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:08,911 INFO L93 Difference]: Finished difference Result 1179 states and 1643 transitions. [2024-11-08 19:15:08,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 19:15:08,911 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-08 19:15:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:08,913 INFO L225 Difference]: With dead ends: 1179 [2024-11-08 19:15:08,913 INFO L226 Difference]: Without dead ends: 1010 [2024-11-08 19:15:08,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2024-11-08 19:15:08,914 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 93 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:08,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 2117 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-11-08 19:15:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 998. [2024-11-08 19:15:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.3841524573721165) internal successors, (1380), 997 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1380 transitions. [2024-11-08 19:15:08,924 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1380 transitions. Word has length 85 [2024-11-08 19:15:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:08,924 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1380 transitions. [2024-11-08 19:15:08,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.722222222222222) internal successors, (85), 18 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1380 transitions. [2024-11-08 19:15:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 19:15:08,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:08,926 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:08,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 19:15:08,926 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:08,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:08,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1141327815, now seen corresponding path program 1 times [2024-11-08 19:15:08,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:08,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228715363] [2024-11-08 19:15:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:08,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:09,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:09,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228715363] [2024-11-08 19:15:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228715363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:09,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:15:09,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083319429] [2024-11-08 19:15:09,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:09,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:15:09,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:09,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:15:09,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:15:09,143 INFO L87 Difference]: Start difference. First operand 998 states and 1380 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:09,215 INFO L93 Difference]: Finished difference Result 1520 states and 2120 transitions. [2024-11-08 19:15:09,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:15:09,215 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-08 19:15:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:09,218 INFO L225 Difference]: With dead ends: 1520 [2024-11-08 19:15:09,218 INFO L226 Difference]: Without dead ends: 891 [2024-11-08 19:15:09,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:15:09,219 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 48 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:09,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1281 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-11-08 19:15:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2024-11-08 19:15:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.3707865168539326) internal successors, (1220), 890 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1220 transitions. [2024-11-08 19:15:09,230 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1220 transitions. Word has length 85 [2024-11-08 19:15:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:09,230 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1220 transitions. [2024-11-08 19:15:09,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:09,230 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1220 transitions. [2024-11-08 19:15:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 19:15:09,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:09,231 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:09,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 19:15:09,232 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:09,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1294933767, now seen corresponding path program 1 times [2024-11-08 19:15:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:09,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382349764] [2024-11-08 19:15:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:09,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:09,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382349764] [2024-11-08 19:15:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382349764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:09,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 19:15:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52075540] [2024-11-08 19:15:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:09,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:15:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:09,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:15:09,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:15:09,482 INFO L87 Difference]: Start difference. First operand 891 states and 1220 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:09,573 INFO L93 Difference]: Finished difference Result 1209 states and 1674 transitions. [2024-11-08 19:15:09,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:15:09,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-08 19:15:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:09,575 INFO L225 Difference]: With dead ends: 1209 [2024-11-08 19:15:09,577 INFO L226 Difference]: Without dead ends: 826 [2024-11-08 19:15:09,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:15:09,578 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 98 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:09,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1129 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2024-11-08 19:15:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 817. [2024-11-08 19:15:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.3602941176470589) internal successors, (1110), 816 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1110 transitions. [2024-11-08 19:15:09,587 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1110 transitions. Word has length 85 [2024-11-08 19:15:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:09,587 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1110 transitions. [2024-11-08 19:15:09,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1110 transitions. [2024-11-08 19:15:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 19:15:09,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:09,589 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:09,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 19:15:09,589 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:09,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:09,590 INFO L85 PathProgramCache]: Analyzing trace with hash -382213465, now seen corresponding path program 1 times [2024-11-08 19:15:09,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:09,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126989200] [2024-11-08 19:15:09,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:09,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:10,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126989200] [2024-11-08 19:15:10,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126989200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236127313] [2024-11-08 19:15:10,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:10,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:10,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:10,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:15:10,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 19:15:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:10,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 19:15:10,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:10,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:15:10,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236127313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:10,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:15:10,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [18] total 33 [2024-11-08 19:15:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206600749] [2024-11-08 19:15:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:10,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 19:15:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:10,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 19:15:10,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=988, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 19:15:10,893 INFO L87 Difference]: Start difference. First operand 817 states and 1110 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:11,155 INFO L93 Difference]: Finished difference Result 1058 states and 1451 transitions. [2024-11-08 19:15:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 19:15:11,156 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-08 19:15:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:11,158 INFO L225 Difference]: With dead ends: 1058 [2024-11-08 19:15:11,158 INFO L226 Difference]: Without dead ends: 891 [2024-11-08 19:15:11,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=1316, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 19:15:11,159 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 93 mSDsluCounter, 2337 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:11,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 2524 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2024-11-08 19:15:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 885. [2024-11-08 19:15:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.3597285067873304) internal successors, (1202), 884 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1202 transitions. [2024-11-08 19:15:11,167 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1202 transitions. Word has length 85 [2024-11-08 19:15:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:11,167 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1202 transitions. [2024-11-08 19:15:11,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 17 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1202 transitions. [2024-11-08 19:15:11,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 19:15:11,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:11,169 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:11,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 19:15:11,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:11,370 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:11,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1862311573, now seen corresponding path program 1 times [2024-11-08 19:15:11,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:11,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788443561] [2024-11-08 19:15:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:11,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:11,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:11,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788443561] [2024-11-08 19:15:11,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788443561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:11,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:11,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-08 19:15:11,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664210689] [2024-11-08 19:15:11,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:11,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 19:15:11,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:11,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 19:15:11,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:15:11,906 INFO L87 Difference]: Start difference. First operand 885 states and 1202 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:12,186 INFO L93 Difference]: Finished difference Result 1151 states and 1576 transitions. [2024-11-08 19:15:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 19:15:12,186 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-08 19:15:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:12,188 INFO L225 Difference]: With dead ends: 1151 [2024-11-08 19:15:12,188 INFO L226 Difference]: Without dead ends: 848 [2024-11-08 19:15:12,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-08 19:15:12,189 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 197 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 2053 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:12,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 2053 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-08 19:15:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 848. [2024-11-08 19:15:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 1.343565525383707) internal successors, (1138), 847 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1138 transitions. [2024-11-08 19:15:12,197 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1138 transitions. Word has length 85 [2024-11-08 19:15:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:12,198 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1138 transitions. [2024-11-08 19:15:12,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1138 transitions. [2024-11-08 19:15:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 19:15:12,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:12,199 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:12,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 19:15:12,199 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:12,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:12,200 INFO L85 PathProgramCache]: Analyzing trace with hash 6438362, now seen corresponding path program 1 times [2024-11-08 19:15:12,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:12,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121837633] [2024-11-08 19:15:12,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:12,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:12,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:12,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121837633] [2024-11-08 19:15:12,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121837633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:12,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:12,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 19:15:12,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210714169] [2024-11-08 19:15:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:12,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:15:12,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:12,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:15:12,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:15:12,545 INFO L87 Difference]: Start difference. First operand 848 states and 1138 transitions. Second operand has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:12,697 INFO L93 Difference]: Finished difference Result 1159 states and 1573 transitions. [2024-11-08 19:15:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 19:15:12,697 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-08 19:15:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:12,699 INFO L225 Difference]: With dead ends: 1159 [2024-11-08 19:15:12,701 INFO L226 Difference]: Without dead ends: 895 [2024-11-08 19:15:12,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:15:12,702 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 64 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:12,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1977 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-11-08 19:15:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 889. [2024-11-08 19:15:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.3310810810810811) internal successors, (1182), 888 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1182 transitions. [2024-11-08 19:15:12,717 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1182 transitions. Word has length 85 [2024-11-08 19:15:12,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:12,718 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1182 transitions. [2024-11-08 19:15:12,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.538461538461538) internal successors, (85), 13 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1182 transitions. [2024-11-08 19:15:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 19:15:12,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:12,720 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:12,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 19:15:12,720 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:12,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash 812535856, now seen corresponding path program 1 times [2024-11-08 19:15:12,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:12,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736273553] [2024-11-08 19:15:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:12,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:12,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:12,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736273553] [2024-11-08 19:15:12,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736273553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:12,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:12,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:15:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248296485] [2024-11-08 19:15:12,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:12,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:15:12,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:12,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:15:12,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:15:12,828 INFO L87 Difference]: Start difference. First operand 889 states and 1182 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:12,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:12,852 INFO L93 Difference]: Finished difference Result 1051 states and 1414 transitions. [2024-11-08 19:15:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:15:12,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-11-08 19:15:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:12,853 INFO L225 Difference]: With dead ends: 1051 [2024-11-08 19:15:12,853 INFO L226 Difference]: Without dead ends: 686 [2024-11-08 19:15:12,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:15:12,854 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 53 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:12,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 658 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-08 19:15:12,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2024-11-08 19:15:12,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 1.332846715328467) internal successors, (913), 685 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:12,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 913 transitions. [2024-11-08 19:15:12,866 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 913 transitions. Word has length 85 [2024-11-08 19:15:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:12,866 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 913 transitions. [2024-11-08 19:15:12,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 913 transitions. [2024-11-08 19:15:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 19:15:12,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:12,867 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:12,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 19:15:12,868 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:12,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:12,868 INFO L85 PathProgramCache]: Analyzing trace with hash -976308674, now seen corresponding path program 1 times [2024-11-08 19:15:12,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:12,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042249954] [2024-11-08 19:15:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:12,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:13,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:13,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042249954] [2024-11-08 19:15:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042249954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:13,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:13,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:15:13,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001563520] [2024-11-08 19:15:13,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:13,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:15:13,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:13,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:15:13,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:13,091 INFO L87 Difference]: Start difference. First operand 686 states and 913 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:13,126 INFO L93 Difference]: Finished difference Result 981 states and 1317 transitions. [2024-11-08 19:15:13,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:15:13,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-08 19:15:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:13,128 INFO L225 Difference]: With dead ends: 981 [2024-11-08 19:15:13,128 INFO L226 Difference]: Without dead ends: 750 [2024-11-08 19:15:13,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:13,130 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 4 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:13,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1026 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-11-08 19:15:13,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 750. [2024-11-08 19:15:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 749 states have (on average 1.3230974632843793) internal successors, (991), 749 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 991 transitions. [2024-11-08 19:15:13,140 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 991 transitions. Word has length 86 [2024-11-08 19:15:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:13,140 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 991 transitions. [2024-11-08 19:15:13,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 991 transitions. [2024-11-08 19:15:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 19:15:13,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:13,142 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:13,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-08 19:15:13,142 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:13,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1161001005, now seen corresponding path program 1 times [2024-11-08 19:15:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:13,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108078200] [2024-11-08 19:15:13,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:13,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:13,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:13,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108078200] [2024-11-08 19:15:13,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108078200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:13,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:13,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 19:15:13,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013543578] [2024-11-08 19:15:13,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:13,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 19:15:13,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:13,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 19:15:13,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-08 19:15:13,869 INFO L87 Difference]: Start difference. First operand 750 states and 991 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:14,025 INFO L93 Difference]: Finished difference Result 1017 states and 1369 transitions. [2024-11-08 19:15:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 19:15:14,025 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-08 19:15:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:14,027 INFO L225 Difference]: With dead ends: 1017 [2024-11-08 19:15:14,027 INFO L226 Difference]: Without dead ends: 806 [2024-11-08 19:15:14,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-11-08 19:15:14,027 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 36 mSDsluCounter, 1838 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:14,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2023 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-11-08 19:15:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 795. [2024-11-08 19:15:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 1.3287153652392947) internal successors, (1055), 794 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1055 transitions. [2024-11-08 19:15:14,035 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1055 transitions. Word has length 86 [2024-11-08 19:15:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:14,035 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1055 transitions. [2024-11-08 19:15:14,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 15 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1055 transitions. [2024-11-08 19:15:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 19:15:14,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:14,036 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:14,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 19:15:14,036 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:14,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:14,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1054022121, now seen corresponding path program 1 times [2024-11-08 19:15:14,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:14,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109107829] [2024-11-08 19:15:14,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:14,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:14,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:14,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109107829] [2024-11-08 19:15:14,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109107829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:14,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:14,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 19:15:14,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637701648] [2024-11-08 19:15:14,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:14,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 19:15:14,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:14,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 19:15:14,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:15:14,408 INFO L87 Difference]: Start difference. First operand 795 states and 1055 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:14,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:14,471 INFO L93 Difference]: Finished difference Result 1282 states and 1718 transitions. [2024-11-08 19:15:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:15:14,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-08 19:15:14,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:14,474 INFO L225 Difference]: With dead ends: 1282 [2024-11-08 19:15:14,474 INFO L226 Difference]: Without dead ends: 954 [2024-11-08 19:15:14,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:15:14,475 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 29 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:14,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1244 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:14,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2024-11-08 19:15:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 786. [2024-11-08 19:15:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3286624203821655) internal successors, (1043), 785 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:14,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1043 transitions. [2024-11-08 19:15:14,489 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1043 transitions. Word has length 86 [2024-11-08 19:15:14,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:14,490 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1043 transitions. [2024-11-08 19:15:14,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1043 transitions. [2024-11-08 19:15:14,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 19:15:14,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:14,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:14,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-08 19:15:14,491 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:14,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash -303578103, now seen corresponding path program 1 times [2024-11-08 19:15:14,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:14,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332884916] [2024-11-08 19:15:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:15,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:15,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:15,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332884916] [2024-11-08 19:15:15,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332884916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:15,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:15,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-08 19:15:15,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8335445] [2024-11-08 19:15:15,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:15,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 19:15:15,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:15,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 19:15:15,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:15:15,217 INFO L87 Difference]: Start difference. First operand 786 states and 1043 transitions. Second operand has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:15,561 INFO L93 Difference]: Finished difference Result 1057 states and 1427 transitions. [2024-11-08 19:15:15,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 19:15:15,561 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-08 19:15:15,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:15,563 INFO L225 Difference]: With dead ends: 1057 [2024-11-08 19:15:15,563 INFO L226 Difference]: Without dead ends: 804 [2024-11-08 19:15:15,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-08 19:15:15,564 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 72 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:15,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 2946 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:15:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-08 19:15:15,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 802. [2024-11-08 19:15:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 801 states have (on average 1.3245942571785267) internal successors, (1061), 801 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1061 transitions. [2024-11-08 19:15:15,576 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1061 transitions. Word has length 86 [2024-11-08 19:15:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:15,577 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1061 transitions. [2024-11-08 19:15:15,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.3) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1061 transitions. [2024-11-08 19:15:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 19:15:15,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:15,578 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:15,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-08 19:15:15,578 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:15,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:15,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1688022501, now seen corresponding path program 1 times [2024-11-08 19:15:15,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:15,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118250505] [2024-11-08 19:15:15,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:15,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118250505] [2024-11-08 19:15:16,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118250505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:16,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:16,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 19:15:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956211139] [2024-11-08 19:15:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:16,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 19:15:16,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:16,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 19:15:16,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-08 19:15:16,108 INFO L87 Difference]: Start difference. First operand 802 states and 1061 transitions. Second operand has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:16,354 INFO L93 Difference]: Finished difference Result 1123 states and 1511 transitions. [2024-11-08 19:15:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 19:15:16,354 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-11-08 19:15:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:16,356 INFO L225 Difference]: With dead ends: 1123 [2024-11-08 19:15:16,356 INFO L226 Difference]: Without dead ends: 832 [2024-11-08 19:15:16,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-08 19:15:16,357 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 56 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:16,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2389 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-11-08 19:15:16,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2024-11-08 19:15:16,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 1.3176895306859207) internal successors, (1095), 831 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1095 transitions. [2024-11-08 19:15:16,365 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1095 transitions. Word has length 86 [2024-11-08 19:15:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:16,365 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1095 transitions. [2024-11-08 19:15:16,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1095 transitions. [2024-11-08 19:15:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 19:15:16,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:16,366 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:16,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 19:15:16,366 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:16,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash 490423072, now seen corresponding path program 1 times [2024-11-08 19:15:16,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:16,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105110185] [2024-11-08 19:15:16,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:16,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:16,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105110185] [2024-11-08 19:15:16,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105110185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:16,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:16,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:15:16,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417058483] [2024-11-08 19:15:16,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:16,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:15:16,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:16,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:15:16,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:16,566 INFO L87 Difference]: Start difference. First operand 832 states and 1095 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:16,607 INFO L93 Difference]: Finished difference Result 1470 states and 1947 transitions. [2024-11-08 19:15:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:15:16,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-08 19:15:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:16,610 INFO L225 Difference]: With dead ends: 1470 [2024-11-08 19:15:16,610 INFO L226 Difference]: Without dead ends: 1042 [2024-11-08 19:15:16,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:16,611 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 10 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1030 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:16,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1030 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-08 19:15:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1030. [2024-11-08 19:15:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.2915451895043732) internal successors, (1329), 1029 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1329 transitions. [2024-11-08 19:15:16,622 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1329 transitions. Word has length 87 [2024-11-08 19:15:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:16,623 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1329 transitions. [2024-11-08 19:15:16,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:16,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1329 transitions. [2024-11-08 19:15:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 19:15:16,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:16,625 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:16,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 19:15:16,625 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:16,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:16,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1812859929, now seen corresponding path program 1 times [2024-11-08 19:15:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:16,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069393728] [2024-11-08 19:15:16,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:16,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:17,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:17,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:17,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069393728] [2024-11-08 19:15:17,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069393728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:17,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:17,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-08 19:15:17,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47314686] [2024-11-08 19:15:17,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:17,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-08 19:15:17,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:17,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-08 19:15:17,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-08 19:15:17,343 INFO L87 Difference]: Start difference. First operand 1030 states and 1329 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:17,679 INFO L93 Difference]: Finished difference Result 1394 states and 1827 transitions. [2024-11-08 19:15:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 19:15:17,679 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-08 19:15:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:17,681 INFO L225 Difference]: With dead ends: 1394 [2024-11-08 19:15:17,681 INFO L226 Difference]: Without dead ends: 1054 [2024-11-08 19:15:17,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2024-11-08 19:15:17,682 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 204 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:17,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1658 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:15:17,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-11-08 19:15:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1034. [2024-11-08 19:15:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.2904162633107454) internal successors, (1333), 1033 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1333 transitions. [2024-11-08 19:15:17,695 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1333 transitions. Word has length 87 [2024-11-08 19:15:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:17,695 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1333 transitions. [2024-11-08 19:15:17,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1333 transitions. [2024-11-08 19:15:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 19:15:17,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:17,697 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:17,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 19:15:17,697 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:17,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1852245401, now seen corresponding path program 1 times [2024-11-08 19:15:17,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:17,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024471986] [2024-11-08 19:15:17,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:17,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:18,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:18,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:18,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024471986] [2024-11-08 19:15:18,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024471986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:18,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637706251] [2024-11-08 19:15:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:18,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:18,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:18,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:15:18,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 19:15:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:18,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 19:15:18,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:18,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:15:18,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637706251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:18,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:15:18,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2024-11-08 19:15:18,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424745375] [2024-11-08 19:15:18,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:18,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:15:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:15:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2024-11-08 19:15:18,721 INFO L87 Difference]: Start difference. First operand 1034 states and 1333 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:18,806 INFO L93 Difference]: Finished difference Result 1584 states and 2089 transitions. [2024-11-08 19:15:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:15:18,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-08 19:15:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:18,809 INFO L225 Difference]: With dead ends: 1584 [2024-11-08 19:15:18,809 INFO L226 Difference]: Without dead ends: 1266 [2024-11-08 19:15:18,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2024-11-08 19:15:18,810 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 77 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:18,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1422 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:18,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-08 19:15:18,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1230. [2024-11-08 19:15:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1229 states have (on average 1.2994304312449145) internal successors, (1597), 1229 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1597 transitions. [2024-11-08 19:15:18,820 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1597 transitions. Word has length 87 [2024-11-08 19:15:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:18,820 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1597 transitions. [2024-11-08 19:15:18,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1597 transitions. [2024-11-08 19:15:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 19:15:18,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:18,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:18,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 19:15:19,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:19,022 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:19,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:19,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1202821329, now seen corresponding path program 1 times [2024-11-08 19:15:19,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:19,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287648221] [2024-11-08 19:15:19,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:19,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287648221] [2024-11-08 19:15:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287648221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730871527] [2024-11-08 19:15:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:19,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:19,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:19,713 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:15:19,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 19:15:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:19,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-08 19:15:19,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:21,039 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:15:22,712 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:22,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730871527] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:15:22,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:15:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 29, 27] total 74 [2024-11-08 19:15:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285925490] [2024-11-08 19:15:22,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:15:22,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-08 19:15:22,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-08 19:15:22,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=4770, Unknown=0, NotChecked=0, Total=5402 [2024-11-08 19:15:22,715 INFO L87 Difference]: Start difference. First operand 1230 states and 1597 transitions. Second operand has 74 states, 74 states have (on average 3.3378378378378377) internal successors, (247), 74 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:27,297 INFO L93 Difference]: Finished difference Result 2314 states and 3111 transitions. [2024-11-08 19:15:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-11-08 19:15:27,297 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 3.3378378378378377) internal successors, (247), 74 states have internal predecessors, (247), 0 states have call successors, (0), 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 87 [2024-11-08 19:15:27,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:27,301 INFO L225 Difference]: With dead ends: 2314 [2024-11-08 19:15:27,301 INFO L226 Difference]: Without dead ends: 1907 [2024-11-08 19:15:27,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3248, Invalid=31534, Unknown=0, NotChecked=0, Total=34782 [2024-11-08 19:15:27,307 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 3374 mSDsluCounter, 8505 mSDsCounter, 0 mSdLazyCounter, 4070 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3374 SdHoareTripleChecker+Valid, 8755 SdHoareTripleChecker+Invalid, 4133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 4070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:27,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3374 Valid, 8755 Invalid, 4133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 4070 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 19:15:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2024-11-08 19:15:27,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1525. [2024-11-08 19:15:27,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.3116797900262467) internal successors, (1999), 1524 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:27,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1999 transitions. [2024-11-08 19:15:27,321 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1999 transitions. Word has length 87 [2024-11-08 19:15:27,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:27,321 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 1999 transitions. [2024-11-08 19:15:27,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 3.3378378378378377) internal successors, (247), 74 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:27,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1999 transitions. [2024-11-08 19:15:27,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 19:15:27,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:27,322 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:27,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 19:15:27,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-08 19:15:27,527 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:27,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash 178883271, now seen corresponding path program 1 times [2024-11-08 19:15:27,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:27,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126421733] [2024-11-08 19:15:27,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:27,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:27,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:27,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126421733] [2024-11-08 19:15:27,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126421733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:27,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:27,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:15:27,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908045332] [2024-11-08 19:15:27,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:27,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:15:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:27,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:15:27,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:15:27,738 INFO L87 Difference]: Start difference. First operand 1525 states and 1999 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:27,816 INFO L93 Difference]: Finished difference Result 2259 states and 3036 transitions. [2024-11-08 19:15:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:15:27,817 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-08 19:15:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:27,823 INFO L225 Difference]: With dead ends: 2259 [2024-11-08 19:15:27,823 INFO L226 Difference]: Without dead ends: 1648 [2024-11-08 19:15:27,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:15:27,825 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 11 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:27,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1447 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-08 19:15:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1628. [2024-11-08 19:15:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1627 states have (on average 1.3097725875845114) internal successors, (2131), 1627 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2131 transitions. [2024-11-08 19:15:27,864 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2131 transitions. Word has length 87 [2024-11-08 19:15:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:27,865 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2131 transitions. [2024-11-08 19:15:27,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2131 transitions. [2024-11-08 19:15:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 19:15:27,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:27,866 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:27,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-08 19:15:27,867 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:27,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:27,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1801897753, now seen corresponding path program 1 times [2024-11-08 19:15:27,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:27,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219005907] [2024-11-08 19:15:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:27,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:27,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:27,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219005907] [2024-11-08 19:15:27,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219005907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:27,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:27,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:15:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242713198] [2024-11-08 19:15:27,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:27,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:15:27,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:27,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:15:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:15:27,969 INFO L87 Difference]: Start difference. First operand 1628 states and 2131 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:27,999 INFO L93 Difference]: Finished difference Result 3197 states and 4183 transitions. [2024-11-08 19:15:27,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:15:27,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-08 19:15:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:28,002 INFO L225 Difference]: With dead ends: 3197 [2024-11-08 19:15:28,002 INFO L226 Difference]: Without dead ends: 1617 [2024-11-08 19:15:28,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:15:28,003 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 53 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:28,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 657 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:28,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2024-11-08 19:15:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2024-11-08 19:15:28,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1616 states have (on average 1.306930693069307) internal successors, (2112), 1616 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2112 transitions. [2024-11-08 19:15:28,019 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2112 transitions. Word has length 87 [2024-11-08 19:15:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:28,020 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2112 transitions. [2024-11-08 19:15:28,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2112 transitions. [2024-11-08 19:15:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 19:15:28,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:28,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:28,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 19:15:28,022 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:28,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:28,022 INFO L85 PathProgramCache]: Analyzing trace with hash 515411624, now seen corresponding path program 1 times [2024-11-08 19:15:28,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:28,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705269864] [2024-11-08 19:15:28,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:28,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:28,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:28,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705269864] [2024-11-08 19:15:28,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705269864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:28,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256870424] [2024-11-08 19:15:28,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:28,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:28,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:28,288 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:15:28,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 19:15:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:28,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 19:15:28,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:28,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:15:28,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256870424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:28,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:15:28,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 17 [2024-11-08 19:15:28,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164592524] [2024-11-08 19:15:28,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:28,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:15:28,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:15:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2024-11-08 19:15:28,553 INFO L87 Difference]: Start difference. First operand 1617 states and 2112 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:28,617 INFO L93 Difference]: Finished difference Result 3200 states and 4180 transitions. [2024-11-08 19:15:28,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 19:15:28,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-11-08 19:15:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:28,620 INFO L225 Difference]: With dead ends: 3200 [2024-11-08 19:15:28,620 INFO L226 Difference]: Without dead ends: 1619 [2024-11-08 19:15:28,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-08 19:15:28,621 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 117 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 988 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.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:28,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 988 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2024-11-08 19:15:28,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2024-11-08 19:15:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1618 states have (on average 1.3065512978986402) internal successors, (2114), 1618 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2114 transitions. [2024-11-08 19:15:28,636 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2114 transitions. Word has length 87 [2024-11-08 19:15:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:28,636 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2114 transitions. [2024-11-08 19:15:28,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2114 transitions. [2024-11-08 19:15:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 19:15:28,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:28,638 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:28,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 19:15:28,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-08 19:15:28,839 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:28,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1554612603, now seen corresponding path program 1 times [2024-11-08 19:15:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540876060] [2024-11-08 19:15:28,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:29,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:29,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540876060] [2024-11-08 19:15:29,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540876060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:29,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:29,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 19:15:29,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292705824] [2024-11-08 19:15:29,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:29,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 19:15:29,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:29,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 19:15:29,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:15:29,507 INFO L87 Difference]: Start difference. First operand 1619 states and 2114 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:29,600 INFO L93 Difference]: Finished difference Result 2459 states and 3288 transitions. [2024-11-08 19:15:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 19:15:29,600 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-08 19:15:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:29,602 INFO L225 Difference]: With dead ends: 2459 [2024-11-08 19:15:29,602 INFO L226 Difference]: Without dead ends: 1650 [2024-11-08 19:15:29,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:15:29,603 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 32 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:29,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1500 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2024-11-08 19:15:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1644. [2024-11-08 19:15:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1643 states have (on average 1.3164942178940962) internal successors, (2163), 1643 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2163 transitions. [2024-11-08 19:15:29,619 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2163 transitions. Word has length 88 [2024-11-08 19:15:29,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:29,619 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 2163 transitions. [2024-11-08 19:15:29,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:29,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2163 transitions. [2024-11-08 19:15:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 19:15:29,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:29,621 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:29,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-08 19:15:29,621 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:29,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:29,621 INFO L85 PathProgramCache]: Analyzing trace with hash 475948386, now seen corresponding path program 1 times [2024-11-08 19:15:29,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:29,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677172281] [2024-11-08 19:15:29,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:29,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:29,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677172281] [2024-11-08 19:15:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677172281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 19:15:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994354389] [2024-11-08 19:15:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:29,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 19:15:29,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:29,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 19:15:29,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:15:29,727 INFO L87 Difference]: Start difference. First operand 1644 states and 2163 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:29,758 INFO L93 Difference]: Finished difference Result 2681 states and 3570 transitions. [2024-11-08 19:15:29,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:15:29,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-08 19:15:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:29,760 INFO L225 Difference]: With dead ends: 2681 [2024-11-08 19:15:29,760 INFO L226 Difference]: Without dead ends: 1448 [2024-11-08 19:15:29,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:15:29,761 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 47 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:29,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 657 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2024-11-08 19:15:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1448. [2024-11-08 19:15:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1447 states have (on average 1.294402211472011) internal successors, (1873), 1447 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1873 transitions. [2024-11-08 19:15:29,773 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1873 transitions. Word has length 88 [2024-11-08 19:15:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:29,773 INFO L471 AbstractCegarLoop]: Abstraction has 1448 states and 1873 transitions. [2024-11-08 19:15:29,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1873 transitions. [2024-11-08 19:15:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 19:15:29,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:29,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:29,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-08 19:15:29,775 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:29,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:29,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1114785143, now seen corresponding path program 1 times [2024-11-08 19:15:29,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:29,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849009690] [2024-11-08 19:15:29,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:30,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:30,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849009690] [2024-11-08 19:15:30,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849009690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:30,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:30,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 19:15:30,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881294709] [2024-11-08 19:15:30,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:30,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:15:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:30,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:15:30,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:15:30,141 INFO L87 Difference]: Start difference. First operand 1448 states and 1873 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:30,239 INFO L93 Difference]: Finished difference Result 2245 states and 2995 transitions. [2024-11-08 19:15:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 19:15:30,240 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-08 19:15:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:30,241 INFO L225 Difference]: With dead ends: 2245 [2024-11-08 19:15:30,241 INFO L226 Difference]: Without dead ends: 1423 [2024-11-08 19:15:30,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:15:30,242 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 47 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:30,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1527 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:30,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-11-08 19:15:30,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1390. [2024-11-08 19:15:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 1.2994960403167746) internal successors, (1805), 1389 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1805 transitions. [2024-11-08 19:15:30,254 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1805 transitions. Word has length 88 [2024-11-08 19:15:30,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:30,255 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1805 transitions. [2024-11-08 19:15:30,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1805 transitions. [2024-11-08 19:15:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 19:15:30,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:30,257 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:30,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-08 19:15:30,258 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:30,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:30,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2146959409, now seen corresponding path program 1 times [2024-11-08 19:15:30,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:30,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888617858] [2024-11-08 19:15:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:30,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:30,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888617858] [2024-11-08 19:15:30,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888617858] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:30,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034827657] [2024-11-08 19:15:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:30,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:30,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:30,910 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:15:30,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 19:15:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:31,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 19:15:31,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:31,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:15:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034827657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:15:31,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 19:15:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 47 [2024-11-08 19:15:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106460476] [2024-11-08 19:15:31,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 19:15:31,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 19:15:31,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:31,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 19:15:31,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1957, Unknown=0, NotChecked=0, Total=2162 [2024-11-08 19:15:31,920 INFO L87 Difference]: Start difference. First operand 1390 states and 1805 transitions. Second operand has 47 states, 47 states have (on average 5.212765957446808) internal successors, (245), 47 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:32,812 INFO L93 Difference]: Finished difference Result 3068 states and 4179 transitions. [2024-11-08 19:15:32,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-08 19:15:32,812 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 5.212765957446808) internal successors, (245), 47 states have internal predecessors, (245), 0 states have call successors, (0), 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 88 [2024-11-08 19:15:32,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:32,815 INFO L225 Difference]: With dead ends: 3068 [2024-11-08 19:15:32,815 INFO L226 Difference]: Without dead ends: 2297 [2024-11-08 19:15:32,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=402, Invalid=4568, Unknown=0, NotChecked=0, Total=4970 [2024-11-08 19:15:32,817 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 333 mSDsluCounter, 4113 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 4267 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:32,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 4267 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 19:15:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-11-08 19:15:32,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 1871. [2024-11-08 19:15:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1870 states have (on average 1.3363636363636364) internal successors, (2499), 1870 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2499 transitions. [2024-11-08 19:15:32,834 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2499 transitions. Word has length 88 [2024-11-08 19:15:32,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:32,834 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2499 transitions. [2024-11-08 19:15:32,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.212765957446808) internal successors, (245), 47 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2499 transitions. [2024-11-08 19:15:32,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 19:15:32,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:32,836 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:32,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 19:15:33,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:15:33,036 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:33,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash -36979945, now seen corresponding path program 1 times [2024-11-08 19:15:33,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:33,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517507192] [2024-11-08 19:15:33,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:33,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:33,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:33,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517507192] [2024-11-08 19:15:33,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517507192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:33,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:33,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 19:15:33,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291045482] [2024-11-08 19:15:33,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:33,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 19:15:33,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:33,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 19:15:33,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 19:15:33,297 INFO L87 Difference]: Start difference. First operand 1871 states and 2499 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:33,437 INFO L93 Difference]: Finished difference Result 3157 states and 4318 transitions. [2024-11-08 19:15:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 19:15:33,438 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-08 19:15:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:33,440 INFO L225 Difference]: With dead ends: 3157 [2024-11-08 19:15:33,440 INFO L226 Difference]: Without dead ends: 1871 [2024-11-08 19:15:33,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-08 19:15:33,441 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 89 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:33,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1629 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:15:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2024-11-08 19:15:33,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1871. [2024-11-08 19:15:33,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1870 states have (on average 1.3352941176470587) internal successors, (2497), 1870 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:33,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2497 transitions. [2024-11-08 19:15:33,455 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2497 transitions. Word has length 88 [2024-11-08 19:15:33,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:33,455 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2497 transitions. [2024-11-08 19:15:33,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2497 transitions. [2024-11-08 19:15:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-08 19:15:33,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:33,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:33,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-08 19:15:33,456 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:33,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:33,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1541604825, now seen corresponding path program 1 times [2024-11-08 19:15:33,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:33,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190264505] [2024-11-08 19:15:33,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:33,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:33,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:15:33,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190264505] [2024-11-08 19:15:33,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190264505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:33,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:33,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:15:33,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044120614] [2024-11-08 19:15:33,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:33,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:15:33,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:15:33,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:15:33,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:15:33,562 INFO L87 Difference]: Start difference. First operand 1871 states and 2497 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:33,596 INFO L93 Difference]: Finished difference Result 3348 states and 4526 transitions. [2024-11-08 19:15:33,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 19:15:33,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-11-08 19:15:33,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:33,598 INFO L225 Difference]: With dead ends: 3348 [2024-11-08 19:15:33,598 INFO L226 Difference]: Without dead ends: 1511 [2024-11-08 19:15:33,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:33,599 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 61 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:33,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 823 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:33,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2024-11-08 19:15:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1511. [2024-11-08 19:15:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1510 states have (on average 1.371523178807947) internal successors, (2071), 1510 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2071 transitions. [2024-11-08 19:15:33,610 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2071 transitions. Word has length 88 [2024-11-08 19:15:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:33,610 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2071 transitions. [2024-11-08 19:15:33,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2071 transitions. [2024-11-08 19:15:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-08 19:15:33,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:33,611 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:33,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-08 19:15:33,611 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:33,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -599189839, now seen corresponding path program 1 times [2024-11-08 19:15:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:15:33,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668434862] [2024-11-08 19:15:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:33,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:15:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:15:33,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:15:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:15:33,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:15:33,802 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:15:33,803 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:15:33,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-08 19:15:33,807 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:33,865 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:15:33,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:15:33 BoogieIcfgContainer [2024-11-08 19:15:33,867 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:15:33,867 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:15:33,867 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:15:33,867 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:15:33,868 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:14:50" (3/4) ... [2024-11-08 19:15:33,869 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:15:33,870 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:15:33,871 INFO L158 Benchmark]: Toolchain (without parser) took 44159.32ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 885.0MB). Free memory was 79.3MB in the beginning and 615.7MB in the end (delta: -536.4MB). Peak memory consumption was 348.8MB. Max. memory is 16.1GB. [2024-11-08 19:15:33,871 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:15:33,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.58ms. Allocated memory is still 155.2MB. Free memory was 79.0MB in the beginning and 120.9MB in the end (delta: -41.9MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2024-11-08 19:15:33,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.84ms. Allocated memory is still 155.2MB. Free memory was 120.9MB in the beginning and 109.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 19:15:33,871 INFO L158 Benchmark]: Boogie Preprocessor took 104.10ms. Allocated memory is still 155.2MB. Free memory was 109.6MB in the beginning and 103.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:15:33,871 INFO L158 Benchmark]: RCFGBuilder took 703.72ms. Allocated memory is still 155.2MB. Free memory was 102.8MB in the beginning and 69.0MB in the end (delta: 33.8MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-08 19:15:33,872 INFO L158 Benchmark]: TraceAbstraction took 42970.64ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 885.0MB). Free memory was 68.4MB in the beginning and 615.7MB in the end (delta: -547.4MB). Peak memory consumption was 339.4MB. Max. memory is 16.1GB. [2024-11-08 19:15:33,872 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 1.0GB. Free memory is still 615.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:15:33,872 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 155.2MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.58ms. Allocated memory is still 155.2MB. Free memory was 79.0MB in the beginning and 120.9MB in the end (delta: -41.9MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.84ms. Allocated memory is still 155.2MB. Free memory was 120.9MB in the beginning and 109.6MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.10ms. Allocated memory is still 155.2MB. Free memory was 109.6MB in the beginning and 103.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 703.72ms. Allocated memory is still 155.2MB. Free memory was 102.8MB in the beginning and 69.0MB in the end (delta: 33.8MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 42970.64ms. Allocated memory was 155.2MB in the beginning and 1.0GB in the end (delta: 885.0MB). Free memory was 68.4MB in the beginning and 615.7MB in the end (delta: -547.4MB). Peak memory consumption was 339.4MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 1.0GB. Free memory is still 615.7MB. There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 173, overapproximation of bitwiseAnd at line 113. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 8); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (8 - 1); [L35] const SORT_3 var_14 = 0; [L36] const SORT_3 var_30 = 1; [L38] SORT_1 input_2; [L39] SORT_3 input_4; [L40] SORT_3 input_5; [L41] SORT_3 input_6; [L42] SORT_3 input_7; [L43] SORT_3 input_8; [L44] SORT_3 input_9; [L45] SORT_3 input_10; [L46] SORT_3 input_11; [L47] SORT_12 input_13; [L48] SORT_12 input_34; [L49] SORT_12 input_36; [L50] SORT_3 input_38; [L51] SORT_12 input_100; [L52] SORT_3 input_102; [L53] SORT_1 input_105; [L54] SORT_3 input_107; [L55] SORT_3 input_109; [L56] SORT_3 input_111; [L57] SORT_3 input_113; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L59] SORT_3 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L60] SORT_3 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L61] SORT_3 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_3=1, var_14=0, var_30=1] [L62] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L64] SORT_3 init_16_arg_1 = var_14; [L65] state_15 = init_16_arg_1 [L66] SORT_3 init_18_arg_1 = var_14; [L67] state_17 = init_18_arg_1 [L68] SORT_3 init_21_arg_1 = var_14; [L69] state_20 = init_21_arg_1 [L70] SORT_3 init_25_arg_1 = var_14; [L71] state_24 = init_25_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_34 = __VERIFIER_nondet_uchar() [L85] input_36 = __VERIFIER_nondet_uchar() [L86] input_38 = __VERIFIER_nondet_uchar() [L87] input_100 = __VERIFIER_nondet_uchar() [L88] input_102 = __VERIFIER_nondet_uchar() [L89] input_105 = __VERIFIER_nondet_uchar() [L90] input_107 = __VERIFIER_nondet_uchar() [L91] input_109 = __VERIFIER_nondet_uchar() [L92] input_111 = __VERIFIER_nondet_uchar() [L93] input_113 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_19_arg_0=0, var_19_arg_1=0, var_30=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_22_arg_0=0, var_22_arg_1=0, var_30=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, state_24=0, var_30=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = state_24; [L105] SORT_3 var_26 = ~var_26_arg_0; [L106] SORT_3 var_27_arg_0 = var_23; [L107] SORT_3 var_27_arg_1 = var_26; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_27_arg_0=-1, var_27_arg_1=-1, var_30=1] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L108] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_3 var_31_arg_0 = var_27; [L110] SORT_3 var_31 = ~var_31_arg_0; [L111] SORT_3 var_32_arg_0 = var_30; [L112] SORT_3 var_32_arg_1 = var_31; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_32_arg_0=1, var_32_arg_1=-256] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L113] SORT_3 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1] [L114] var_32 = var_32 & mask_SORT_3 [L115] SORT_3 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND FALSE !(!(cond)) [L116] RET __VERIFIER_assert(!(bad_33_arg_0)) [L118] SORT_3 var_40_arg_0 = state_17; [L119] SORT_3 var_40 = ~var_40_arg_0; [L120] SORT_3 var_41_arg_0 = state_15; [L121] SORT_3 var_41 = ~var_41_arg_0; [L122] SORT_3 var_42_arg_0 = var_41; [L123] SORT_3 var_42_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_42_arg_0=-1, var_42_arg_1=0] [L124] EXPR var_42_arg_0 & var_42_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1] [L124] SORT_3 var_42 = var_42_arg_0 & var_42_arg_1; [L125] SORT_3 var_43_arg_0 = var_42; [L126] SORT_3 var_43 = ~var_43_arg_0; [L127] SORT_3 var_44_arg_0 = var_40; [L128] SORT_3 var_44_arg_1 = var_43; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_44_arg_0=-1, var_44_arg_1=-1] [L129] EXPR var_44_arg_0 | var_44_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1] [L129] SORT_3 var_44 = var_44_arg_0 | var_44_arg_1; [L130] SORT_3 var_45_arg_0 = var_44; [L131] SORT_3 var_45 = ~var_45_arg_0; [L132] SORT_3 var_46_arg_0 = state_17; [L133] SORT_3 var_46_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_45=-256, var_46_arg_0=0, var_46_arg_1=0] [L134] EXPR var_46_arg_0 & var_46_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_41=-1, var_45=-256] [L134] SORT_3 var_46 = var_46_arg_0 & var_46_arg_1; [L135] SORT_3 var_47_arg_0 = var_41; [L136] SORT_3 var_47_arg_1 = var_46; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_45=-256, var_47_arg_0=-1, var_47_arg_1=0] [L137] EXPR var_47_arg_0 | var_47_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_45=-256] [L137] SORT_3 var_47 = var_47_arg_0 | var_47_arg_1; [L138] SORT_3 var_48_arg_0 = var_47; [L139] SORT_3 var_48 = ~var_48_arg_0; [L140] SORT_3 var_49_arg_0 = var_45; [L141] SORT_3 var_49_arg_1 = var_48; VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_49_arg_0=-256, var_49_arg_1=-256] [L142] EXPR var_49_arg_0 | var_49_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1] [L142] SORT_3 var_49 = var_49_arg_0 | var_49_arg_1; [L143] SORT_3 next_115_arg_1 = var_49; [L144] SORT_3 var_51_arg_0 = state_20; [L145] SORT_3 var_51 = ~var_51_arg_0; [L146] SORT_3 var_52_arg_0 = state_17; [L147] SORT_3 var_52_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52_arg_0=0, var_52_arg_1=-1] [L148] EXPR var_52_arg_0 | var_52_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1] [L148] SORT_3 var_52 = var_52_arg_0 | var_52_arg_1; [L149] SORT_3 var_53_arg_0 = state_17; [L150] SORT_3 var_53_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52=255, var_53_arg_0=0, var_53_arg_1=-1] [L151] EXPR var_53_arg_0 & var_53_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_52=255] [L151] SORT_3 var_53 = var_53_arg_0 & var_53_arg_1; [L152] SORT_3 var_54_arg_0 = var_53; [L153] SORT_3 var_54 = ~var_54_arg_0; [L154] SORT_3 var_55_arg_0 = var_52; [L155] SORT_3 var_55_arg_1 = var_54; VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_55_arg_0=255, var_55_arg_1=-1] [L156] EXPR var_55_arg_0 & var_55_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1] [L156] SORT_3 var_55 = var_55_arg_0 & var_55_arg_1; [L157] SORT_3 var_56_arg_0 = var_55; [L158] SORT_3 var_56 = ~var_56_arg_0; [L159] SORT_3 next_116_arg_1 = var_56; [L160] SORT_1 var_58_arg_0 = input_2; [L161] SORT_3 var_58 = var_58_arg_0 >> 0; [L162] SORT_1 var_59_arg_0 = input_2; [L163] SORT_3 var_59 = var_59_arg_0 >> 2; [L164] SORT_3 var_60_arg_0 = var_59; [L165] SORT_3 var_60 = ~var_60_arg_0; [L166] SORT_1 var_61_arg_0 = input_2; [L167] SORT_3 var_61 = var_61_arg_0 >> 1; [L168] SORT_3 var_62_arg_0 = var_60; [L169] SORT_3 var_62_arg_1 = var_61; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62_arg_0=-1, var_62_arg_1=0] [L170] EXPR var_62_arg_0 | var_62_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1] [L170] SORT_3 var_62 = var_62_arg_0 | var_62_arg_1; [L171] SORT_3 var_63_arg_0 = var_58; [L172] SORT_3 var_63_arg_1 = var_62; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_63_arg_0=1, var_63_arg_1=255] [L173] EXPR var_63_arg_0 | var_63_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_17=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255] [L173] SORT_3 var_63 = var_63_arg_0 | var_63_arg_1; [L174] SORT_3 var_64_arg_0 = var_63; [L175] SORT_3 var_64 = ~var_64_arg_0; [L176] SORT_3 var_65_arg_0 = state_15; [L177] SORT_3 var_65_arg_1 = state_17; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_64=-1, var_65_arg_0=0, var_65_arg_1=0] [L178] EXPR var_65_arg_0 | var_65_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_64=-1] [L178] SORT_3 var_65 = var_65_arg_0 | var_65_arg_1; [L179] SORT_3 var_66_arg_0 = var_64; [L180] SORT_3 var_66_arg_1 = var_65; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_65=0, var_66_arg_0=-1, var_66_arg_1=0] [L181] EXPR var_66_arg_0 | var_66_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_51=-1, var_58=1, var_62=255, var_65=0] [L181] SORT_3 var_66 = var_66_arg_0 | var_66_arg_1; [L182] SORT_3 var_67_arg_0 = var_66; [L183] SORT_3 var_67_arg_1 = var_51; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0, var_67_arg_0=255, var_67_arg_1=-1] [L184] EXPR var_67_arg_0 & var_67_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, state_15=0, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0] [L184] SORT_3 var_67 = var_67_arg_0 & var_67_arg_1; [L185] SORT_3 next_117_arg_1 = var_67; [L186] SORT_3 var_69_arg_0 = state_15; [L187] SORT_3 var_69_arg_1 = state_20; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0, var_69_arg_0=0, var_69_arg_1=0] [L188] EXPR var_69_arg_0 & var_69_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_40=-1, var_58=1, var_62=255, var_65=0] [L188] SORT_3 var_69 = var_69_arg_0 & var_69_arg_1; [L189] SORT_3 var_70_arg_0 = var_69; [L190] SORT_3 var_70 = ~var_70_arg_0; [L191] SORT_3 var_71_arg_0 = var_40; [L192] SORT_3 var_71_arg_1 = var_70; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_58=1, var_62=255, var_65=0, var_71_arg_0=-1, var_71_arg_1=-1] [L193] EXPR var_71_arg_0 | var_71_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, state_20=0, var_30=1, var_58=1, var_62=255, var_65=0] [L193] SORT_3 var_71 = var_71_arg_0 | var_71_arg_1; [L194] SORT_3 var_72_arg_0 = var_71; [L195] SORT_3 var_72 = ~var_72_arg_0; [L196] SORT_3 var_73_arg_0 = state_20; [L197] SORT_3 var_73_arg_1 = var_65; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_58=1, var_62=255, var_72=-256, var_73_arg_0=0, var_73_arg_1=0] [L198] EXPR var_73_arg_0 | var_73_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_58=1, var_62=255, var_72=-256] [L198] SORT_3 var_73 = var_73_arg_0 | var_73_arg_1; [L199] SORT_3 var_74_arg_0 = var_73; [L200] SORT_3 var_74 = ~var_74_arg_0; [L201] SORT_3 var_75_arg_0 = var_58; [L202] SORT_3 var_75_arg_1 = var_74; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_72=-256, var_74=-1, var_75_arg_0=1, var_75_arg_1=-1] [L203] EXPR var_75_arg_0 & var_75_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_72=-256, var_74=-1] [L203] SORT_3 var_75 = var_75_arg_0 & var_75_arg_1; [L204] SORT_3 var_76_arg_0 = var_75; [L205] SORT_3 var_76 = ~var_76_arg_0; [L206] SORT_3 var_77_arg_0 = var_76; [L207] SORT_3 var_77 = ~var_77_arg_0; [L208] SORT_3 var_78_arg_0 = var_72; [L209] SORT_3 var_78_arg_1 = var_77; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_74=-1, var_78_arg_0=-256, var_78_arg_1=-256] [L210] EXPR var_78_arg_0 | var_78_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_62=255, var_74=-1] [L210] SORT_3 var_78 = var_78_arg_0 | var_78_arg_1; [L211] SORT_3 var_79_arg_0 = var_62; [L212] SORT_3 var_79_arg_1 = var_74; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_78=0, var_79_arg_0=255, var_79_arg_1=-1] [L213] EXPR var_79_arg_0 & var_79_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_78=0] [L213] SORT_3 var_79 = var_79_arg_0 & var_79_arg_1; [L214] SORT_3 var_80_arg_0 = var_78; [L215] SORT_3 var_80_arg_1 = var_79; VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1, var_80_arg_0=0, var_80_arg_1=255] [L216] EXPR var_80_arg_0 | var_80_arg_1 VAL [mask_SORT_3=1, next_115_arg_1=0, next_116_arg_1=-256, next_117_arg_1=255, var_30=1] [L216] SORT_3 var_80 = var_80_arg_0 | var_80_arg_1; [L217] SORT_3 next_118_arg_1 = var_80; [L219] state_15 = next_115_arg_1 [L220] state_17 = next_116_arg_1 [L221] state_20 = next_117_arg_1 [L222] state_24 = next_118_arg_1 [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_4 = __VERIFIER_nondet_uchar() [L76] input_5 = __VERIFIER_nondet_uchar() [L77] input_6 = __VERIFIER_nondet_uchar() [L78] input_7 = __VERIFIER_nondet_uchar() [L79] input_8 = __VERIFIER_nondet_uchar() [L80] input_9 = __VERIFIER_nondet_uchar() [L81] input_10 = __VERIFIER_nondet_uchar() [L82] input_11 = __VERIFIER_nondet_uchar() [L83] input_13 = __VERIFIER_nondet_uchar() [L84] input_34 = __VERIFIER_nondet_uchar() [L85] input_36 = __VERIFIER_nondet_uchar() [L86] input_38 = __VERIFIER_nondet_uchar() [L87] input_100 = __VERIFIER_nondet_uchar() [L88] input_102 = __VERIFIER_nondet_uchar() [L89] input_105 = __VERIFIER_nondet_uchar() [L90] input_107 = __VERIFIER_nondet_uchar() [L91] input_109 = __VERIFIER_nondet_uchar() [L92] input_111 = __VERIFIER_nondet_uchar() [L93] input_113 = __VERIFIER_nondet_uchar() [L96] SORT_3 var_19_arg_0 = state_15; [L97] SORT_3 var_19_arg_1 = state_17; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_19_arg_0=0, var_19_arg_1=-256, var_30=1] [L98] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_30=1] [L98] SORT_3 var_19 = var_19_arg_0 | var_19_arg_1; [L99] SORT_3 var_22_arg_0 = var_19; [L100] SORT_3 var_22_arg_1 = state_20; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_22_arg_0=0, var_22_arg_1=255, var_30=1] [L101] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, state_24=255, var_30=1] [L101] SORT_3 var_22 = var_22_arg_0 | var_22_arg_1; [L102] SORT_3 var_23_arg_0 = var_22; [L103] SORT_3 var_23 = ~var_23_arg_0; [L104] SORT_3 var_26_arg_0 = state_24; [L105] SORT_3 var_26 = ~var_26_arg_0; [L106] SORT_3 var_27_arg_0 = var_23; [L107] SORT_3 var_27_arg_1 = var_26; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_27_arg_0=-256, var_27_arg_1=-256, var_30=1] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L108] SORT_3 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_3 var_31_arg_0 = var_27; [L110] SORT_3 var_31 = ~var_31_arg_0; [L111] SORT_3 var_32_arg_0 = var_30; [L112] SORT_3 var_32_arg_1 = var_31; VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1, var_32_arg_0=1, var_32_arg_1=-1] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L113] SORT_3 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_3 VAL [mask_SORT_3=1, state_15=0, state_17=-256, state_20=255, var_30=1] [L114] var_32 = var_32 & mask_SORT_3 [L115] SORT_3 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.9s, OverallIterations: 45, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8111 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8111 mSDsluCounter, 76844 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69017 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15892 IncrementalHoareTripleChecker+Invalid, 16048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 7827 mSDtfsCounter, 15892 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1722 GetRequests, 870 SyntacticMatches, 5 SemanticMatches, 847 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14003 ImplicationChecksByTransitivity, 13.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1871occurred in iteration=42, InterpolantAutomatonStates: 652, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 2190 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 23.2s InterpolantComputationTime, 4078 NumberOfCodeBlocks, 4078 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 4276 ConstructedInterpolants, 0 QuantifiedInterpolants, 24565 SizeOfPredicates, 40 NumberOfNonLiveVariables, 3386 ConjunctsInSsa, 461 ConjunctsInUnsatCore, 55 InterpolantComputations, 40 PerfectInterpolantSequences, 503/588 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:15:33,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:15:35,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:15:35,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 19:15:35,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:15:35,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:15:35,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:15:35,717 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:15:35,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:15:35,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:15:35,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:15:35,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:15:35,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:15:35,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:15:35,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:15:35,720 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:15:35,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:15:35,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:15:35,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:15:35,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:15:35,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:15:35,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:15:35,723 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:15:35,723 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:15:35,724 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:15:35,724 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:15:35,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:15:35,724 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:15:35,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:15:35,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:15:35,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:15:35,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:15:35,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:15:35,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:15:35,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:15:35,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:15:35,731 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:15:35,732 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:15:35,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:15:35,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:15:35,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:15:35,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:15:35,733 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 -> 895ff1e019ffafaf8b2f8e3efbd16ea4845b2e4eac0a4db8b4c86c462883ae8c [2024-11-08 19:15:35,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:15:36,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:15:36,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:15:36,003 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:15:36,004 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:15:36,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-11-08 19:15:37,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:15:37,430 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:15:37,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-11-08 19:15:37,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0db950fa/2a5638accc5545bc8e52f9fe4cb8b2d8/FLAG7db5f8c6b [2024-11-08 19:15:37,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0db950fa/2a5638accc5545bc8e52f9fe4cb8b2d8 [2024-11-08 19:15:37,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:15:37,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:15:37,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:15:37,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:15:37,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:15:37,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713670b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37, skipping insertion in model container [2024-11-08 19:15:37,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:15:37,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-11-08 19:15:37,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:15:37,719 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:15:37,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_s1269b_p2.c[1259,1272] [2024-11-08 19:15:37,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:15:37,779 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:15:37,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37 WrapperNode [2024-11-08 19:15:37,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:15:37,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:15:37,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:15:37,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:15:37,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,821 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2024-11-08 19:15:37,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:15:37,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:15:37,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:15:37,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:15:37,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,853 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:15:37,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,861 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,864 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,865 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:15:37,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:15:37,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:15:37,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:15:37,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (1/1) ... [2024-11-08 19:15:37,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:15:37,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:15:37,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:15:37,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:15:37,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:15:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:15:37,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:15:37,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:15:38,009 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:15:38,010 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:15:38,217 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-08 19:15:38,217 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:15:38,227 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:15:38,228 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:15:38,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:38 BoogieIcfgContainer [2024-11-08 19:15:38,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:15:38,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:15:38,231 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:15:38,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:15:38,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:15:37" (1/3) ... [2024-11-08 19:15:38,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a79794a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:15:38, skipping insertion in model container [2024-11-08 19:15:38,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:15:37" (2/3) ... [2024-11-08 19:15:38,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a79794a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:15:38, skipping insertion in model container [2024-11-08 19:15:38,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:38" (3/3) ... [2024-11-08 19:15:38,236 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_s1269b_p2.c [2024-11-08 19:15:38,248 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:15:38,249 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:15:38,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:15:38,302 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;@17c87a1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:15:38,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:15:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 19:15:38,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:38,316 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 19:15:38,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:38,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 19:15:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:15:38,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388029761] [2024-11-08 19:15:38,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:38,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:15:38,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:15:38,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:15:38,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:15:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:38,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 19:15:38,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:38,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:15:38,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:15:38,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388029761] [2024-11-08 19:15:38,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388029761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:15:38,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:15:38,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:15:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887819091] [2024-11-08 19:15:38,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:38,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:15:38,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:15:38,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:15:38,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:15:38,589 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:38,620 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-08 19:15:38,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:15:38,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-11-08 19:15:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:38,627 INFO L225 Difference]: With dead ends: 17 [2024-11-08 19:15:38,627 INFO L226 Difference]: Without dead ends: 9 [2024-11-08 19:15:38,629 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-11-08 19:15:38,633 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:38,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:38,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-08 19:15:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-08 19:15:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 19:15:38,663 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 19:15:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:38,663 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 19:15:38,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 19:15:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 19:15:38,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:15:38,664 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 19:15:38,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:15:38,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:15:38,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:15:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:15:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 19:15:38,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:15:38,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160750598] [2024-11-08 19:15:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:15:38,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:15:38,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:15:38,874 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:15:38,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:15:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:15:38,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 19:15:38,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:15:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:39,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:15:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 19:15:39,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:15:39,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160750598] [2024-11-08 19:15:39,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160750598] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 19:15:39,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:15:39,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-08 19:15:39,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263051960] [2024-11-08 19:15:39,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:15:39,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:15:39,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:15:39,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:15:39,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:39,228 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:15:39,247 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2024-11-08 19:15:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:15:39,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-11-08 19:15:39,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:15:39,248 INFO L225 Difference]: With dead ends: 9 [2024-11-08 19:15:39,248 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 19:15:39,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:15:39,249 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:15:39,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:15:39,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 19:15:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 19:15:39,250 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-11-08 19:15:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 19:15:39,250 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2024-11-08 19:15:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:15:39,251 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 19:15:39,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:15:39,251 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 19:15:39,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:15:39,253 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:15:39,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 19:15:39,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:15:39,457 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-08 19:15:39,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 19:15:39,477 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:15:39,484 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 19:15:39,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:15:39 BoogieIcfgContainer [2024-11-08 19:15:39,485 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:15:39,486 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:15:39,486 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:15:39,486 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:15:39,486 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:15:38" (3/4) ... [2024-11-08 19:15:39,488 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:15:39,496 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-08 19:15:39,497 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 19:15:39,498 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 19:15:39,498 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 19:15:39,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 19:15:39,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 19:15:39,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:15:39,586 INFO L158 Benchmark]: Toolchain (without parser) took 2128.12ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 38.3MB in the beginning and 39.8MB in the end (delta: -1.4MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-11-08 19:15:39,587 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 54.5MB. Free memory is still 29.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:15:39,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.23ms. Allocated memory is still 71.3MB. Free memory was 38.0MB in the beginning and 39.1MB in the end (delta: -1.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-08 19:15:39,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.72ms. Allocated memory is still 71.3MB. Free memory was 39.1MB in the beginning and 36.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 19:15:39,587 INFO L158 Benchmark]: Boogie Preprocessor took 42.83ms. Allocated memory is still 71.3MB. Free memory was 36.3MB in the beginning and 33.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:15:39,590 INFO L158 Benchmark]: RCFGBuilder took 359.14ms. Allocated memory is still 71.3MB. Free memory was 33.1MB in the beginning and 34.7MB in the end (delta: -1.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-08 19:15:39,590 INFO L158 Benchmark]: TraceAbstraction took 1254.84ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 34.0MB in the beginning and 46.1MB in the end (delta: -12.1MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-08 19:15:39,590 INFO L158 Benchmark]: Witness Printer took 100.18ms. Allocated memory is still 100.7MB. Free memory was 46.1MB in the beginning and 39.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:15:39,591 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.10ms. Allocated memory is still 54.5MB. Free memory is still 29.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.23ms. Allocated memory is still 71.3MB. Free memory was 38.0MB in the beginning and 39.1MB in the end (delta: -1.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.72ms. Allocated memory is still 71.3MB. Free memory was 39.1MB in the beginning and 36.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.83ms. Allocated memory is still 71.3MB. Free memory was 36.3MB in the beginning and 33.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 359.14ms. Allocated memory is still 71.3MB. Free memory was 33.1MB in the beginning and 34.7MB in the end (delta: -1.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1254.84ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 34.0MB in the beginning and 46.1MB in the end (delta: -12.1MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Witness Printer took 100.18ms. Allocated memory is still 100.7MB. Free memory was 46.1MB in the beginning and 39.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 8 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 2 QuantifiedInterpolants, 196 SizeOfPredicates, 6 NumberOfNonLiveVariables, 128 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2/4 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: 72]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-08 19:15:39,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE