./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/loop-lit/hh2012-ex3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:17:52,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:17:52,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:17:52,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:17:52,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:17:52,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:17:52,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:17:52,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:17:52,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:17:52,427 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:17:52,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:17:52,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:17:52,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:17:52,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:17:52,429 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:17:52,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:17:52,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:17:52,430 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:17:52,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:17:52,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:17:52,431 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:17:52,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:17:52,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:17:52,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:17:52,435 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:17:52,435 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:17:52,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:17:52,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:17:52,436 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:17:52,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:17:52,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:17:52,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:17:52,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:17:52,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:17:52,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:17:52,437 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:17:52,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:17:52,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:17:52,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:17:52,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:17:52,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:17:52,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:17:52,441 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb [2024-11-09 22:17:52,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:17:52,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:17:52,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:17:52,659 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:17:52,659 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:17:52,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-11-09 22:17:53,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:17:54,104 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:17:54,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-11-09 22:17:54,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16ed9631/9291d131d38d4703a3fd7f64526f20f5/FLAG976e26e6b [2024-11-09 22:17:54,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a16ed9631/9291d131d38d4703a3fd7f64526f20f5 [2024-11-09 22:17:54,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:17:54,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:17:54,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:17:54,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:17:54,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:17:54,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d98199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54, skipping insertion in model container [2024-11-09 22:17:54,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:17:54,287 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/loop-lit/hh2012-ex3.i[799,812] [2024-11-09 22:17:54,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:17:54,306 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:17:54,324 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/loop-lit/hh2012-ex3.i[799,812] [2024-11-09 22:17:54,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:17:54,355 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:17:54,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54 WrapperNode [2024-11-09 22:17:54,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:17:54,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:17:54,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:17:54,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:17:54,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,379 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2024-11-09 22:17:54,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:17:54,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:17:54,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:17:54,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:17:54,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,396 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-09 22:17:54,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,398 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:17:54,401 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:17:54,401 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:17:54,401 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:17:54,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (1/1) ... [2024-11-09 22:17:54,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:17:54,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:17:54,432 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-09 22:17:54,439 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-09 22:17:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:17:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:17:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:17:54,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:17:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 22:17:54,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 22:17:54,532 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:17:54,534 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:17:54,636 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-09 22:17:54,636 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:17:54,649 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:17:54,650 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:17:54,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:17:54 BoogieIcfgContainer [2024-11-09 22:17:54,651 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:17:54,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:17:54,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:17:54,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:17:54,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:17:54" (1/3) ... [2024-11-09 22:17:54,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415243a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:17:54, skipping insertion in model container [2024-11-09 22:17:54,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:17:54" (2/3) ... [2024-11-09 22:17:54,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@415243a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:17:54, skipping insertion in model container [2024-11-09 22:17:54,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:17:54" (3/3) ... [2024-11-09 22:17:54,658 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-11-09 22:17:54,670 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:17:54,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:17:54,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:17:54,730 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;@37cd8ac1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:17:54,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:17:54,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 22:17:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 22:17:54,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:54,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:54,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:54,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:54,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1173652236, now seen corresponding path program 1 times [2024-11-09 22:17:54,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917019555] [2024-11-09 22:17:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:54,891 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-09 22:17:54,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:54,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917019555] [2024-11-09 22:17:54,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917019555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:17:54,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:17:54,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 22:17:54,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438945953] [2024-11-09 22:17:54,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:17:54,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:17:54,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:17:54,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:17:54,918 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:17:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:54,933 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2024-11-09 22:17:54,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:17:54,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 22:17:54,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:54,940 INFO L225 Difference]: With dead ends: 51 [2024-11-09 22:17:54,941 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 22:17:54,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 22:17:54,948 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:54,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:17:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 22:17:54,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 22:17:54,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 22:17:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-11-09 22:17:54,983 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 10 [2024-11-09 22:17:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:54,983 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-11-09 22:17:54,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:17:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2024-11-09 22:17:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 22:17:54,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:54,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:54,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 22:17:54,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:54,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash 589815210, now seen corresponding path program 1 times [2024-11-09 22:17:54,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:54,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638262728] [2024-11-09 22:17:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,123 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-09 22:17:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638262728] [2024-11-09 22:17:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638262728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:17:55,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:17:55,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 22:17:55,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354962045] [2024-11-09 22:17:55,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:17:55,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:17:55,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:55,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:17:55,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 22:17:55,130 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:17:55,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:55,146 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2024-11-09 22:17:55,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:17:55,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 22:17:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:55,148 INFO L225 Difference]: With dead ends: 44 [2024-11-09 22:17:55,148 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 22:17:55,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-09 22:17:55,149 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:55,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:17:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 22:17:55,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 22:17:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 22:17:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-11-09 22:17:55,156 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 11 [2024-11-09 22:17:55,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:55,157 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-09 22:17:55,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:17:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-09 22:17:55,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 22:17:55,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:55,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:55,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 22:17:55,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:55,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:55,158 INFO L85 PathProgramCache]: Analyzing trace with hash 654461680, now seen corresponding path program 1 times [2024-11-09 22:17:55,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:55,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221610323] [2024-11-09 22:17:55,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:55,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,264 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-09 22:17:55,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:55,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221610323] [2024-11-09 22:17:55,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221610323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:17:55,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:17:55,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:17:55,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342524774] [2024-11-09 22:17:55,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:17:55,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:17:55,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:55,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:17:55,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:17:55,267 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:17:55,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:55,327 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-09 22:17:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:17:55,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 22:17:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:55,328 INFO L225 Difference]: With dead ends: 31 [2024-11-09 22:17:55,328 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 22:17:55,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:17:55,329 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:55,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 94 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:17:55,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 22:17:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 22:17:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 22:17:55,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-09 22:17:55,336 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2024-11-09 22:17:55,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:55,337 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-09 22:17:55,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 22:17:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-09 22:17:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 22:17:55,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:55,337 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:55,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 22:17:55,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:55,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash 744272650, now seen corresponding path program 1 times [2024-11-09 22:17:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:55,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820389366] [2024-11-09 22:17:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:17:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,435 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-09 22:17:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820389366] [2024-11-09 22:17:55,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820389366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:17:55,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:17:55,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:17:55,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497158983] [2024-11-09 22:17:55,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:17:55,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:17:55,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:55,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:17:55,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:17:55,437 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:17:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:55,519 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-11-09 22:17:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:17:55,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 22:17:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:55,520 INFO L225 Difference]: With dead ends: 50 [2024-11-09 22:17:55,520 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 22:17:55,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:17:55,522 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:55,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:17:55,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 22:17:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-11-09 22:17:55,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 22:17:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2024-11-09 22:17:55,530 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 16 [2024-11-09 22:17:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:55,530 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2024-11-09 22:17:55,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 22:17:55,531 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2024-11-09 22:17:55,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 22:17:55,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:55,531 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:55,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 22:17:55,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:55,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:55,534 INFO L85 PathProgramCache]: Analyzing trace with hash 270232304, now seen corresponding path program 1 times [2024-11-09 22:17:55,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:55,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680964317] [2024-11-09 22:17:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:55,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:17:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:17:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 22:17:55,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680964317] [2024-11-09 22:17:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680964317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:17:55,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:17:55,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:17:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099591601] [2024-11-09 22:17:55,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:17:55,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:17:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:17:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:17:55,652 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:17:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:55,719 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2024-11-09 22:17:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 22:17:55,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-11-09 22:17:55,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:55,726 INFO L225 Difference]: With dead ends: 54 [2024-11-09 22:17:55,727 INFO L226 Difference]: Without dead ends: 51 [2024-11-09 22:17:55,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 22:17:55,728 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 5 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:55,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:17:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-09 22:17:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-11-09 22:17:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 22:17:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-11-09 22:17:55,744 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 21 [2024-11-09 22:17:55,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:55,745 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-11-09 22:17:55,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 22:17:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-11-09 22:17:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 22:17:55,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:55,750 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:55,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 22:17:55,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:55,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:55,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1628712310, now seen corresponding path program 1 times [2024-11-09 22:17:55,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:55,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805880371] [2024-11-09 22:17:55,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:17:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:17:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 22:17:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 22:17:55,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:55,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805880371] [2024-11-09 22:17:55,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805880371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:17:55,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:17:55,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 22:17:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127204526] [2024-11-09 22:17:55,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:17:55,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:17:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:55,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:17:55,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 22:17:55,839 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:17:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:55,893 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2024-11-09 22:17:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:17:55,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-11-09 22:17:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:55,896 INFO L225 Difference]: With dead ends: 102 [2024-11-09 22:17:55,896 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 22:17:55,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:17:55,897 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:55,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 122 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:17:55,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 22:17:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 22:17:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 22:17:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2024-11-09 22:17:55,906 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 26 [2024-11-09 22:17:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:55,906 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2024-11-09 22:17:55,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 22:17:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2024-11-09 22:17:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 22:17:55,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:55,908 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:55,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:17:55,908 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:55,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:55,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1558447233, now seen corresponding path program 1 times [2024-11-09 22:17:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:55,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131965472] [2024-11-09 22:17:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:17:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:17:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 22:17:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 22:17:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 22:17:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 22:17:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 22:17:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-09 22:17:56,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:56,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131965472] [2024-11-09 22:17:56,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131965472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:17:56,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:17:56,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 22:17:56,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8276200] [2024-11-09 22:17:56,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:17:56,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:17:56,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:56,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:17:56,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 22:17:56,052 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 22:17:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:56,100 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2024-11-09 22:17:56,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:17:56,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-11-09 22:17:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:56,102 INFO L225 Difference]: With dead ends: 72 [2024-11-09 22:17:56,102 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 22:17:56,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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-09 22:17:56,103 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:56,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 82 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:17:56,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 22:17:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-09 22:17:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 40 states have internal predecessors, (42), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 22:17:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2024-11-09 22:17:56,119 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 48 [2024-11-09 22:17:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:56,119 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2024-11-09 22:17:56,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 22:17:56,119 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2024-11-09 22:17:56,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 22:17:56,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:56,123 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:56,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 22:17:56,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:56,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:56,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1914485205, now seen corresponding path program 1 times [2024-11-09 22:17:56,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:56,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971199891] [2024-11-09 22:17:56,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:56,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:17:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:17:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 22:17:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 22:17:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 22:17:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 22:17:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 22:17:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 22:17:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 22:17:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:17:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 22:17:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 22:17:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 22:17:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 22:17:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971199891] [2024-11-09 22:17:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971199891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:17:56,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350109431] [2024-11-09 22:17:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:56,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:17:56,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:17:56,223 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-09 22:17:56,224 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-09 22:17:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 22:17:56,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:17:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 188 proven. 10 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-09 22:17:56,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:17:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-09 22:17:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350109431] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:17:56,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:17:56,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 22:17:56,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043905220] [2024-11-09 22:17:56,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:17:56,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:17:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:17:56,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:17:56,447 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-09 22:17:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:56,489 INFO L93 Difference]: Finished difference Result 144 states and 193 transitions. [2024-11-09 22:17:56,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:17:56,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 85 [2024-11-09 22:17:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:56,491 INFO L225 Difference]: With dead ends: 144 [2024-11-09 22:17:56,491 INFO L226 Difference]: Without dead ends: 93 [2024-11-09 22:17:56,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:17:56,494 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:56,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:17:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-09 22:17:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-09 22:17:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 48 states have internal predecessors, (50), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 22:17:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2024-11-09 22:17:56,513 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 85 [2024-11-09 22:17:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:56,513 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2024-11-09 22:17:56,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-11-09 22:17:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2024-11-09 22:17:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 22:17:56,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:56,515 INFO L215 NwaCegarLoop]: trace histogram [22, 21, 21, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:56,529 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-09 22:17:56,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:17:56,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:56,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash -267976515, now seen corresponding path program 2 times [2024-11-09 22:17:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569898916] [2024-11-09 22:17:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:17:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:17:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 22:17:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 22:17:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 22:17:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 22:17:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 22:17:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 22:17:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 22:17:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:17:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 22:17:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 22:17:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 22:17:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 22:17:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 22:17:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:17:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:56,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 22:17:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 22:17:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 22:17:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 22:17:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:57,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:17:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 58 proven. 12 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2024-11-09 22:17:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:57,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569898916] [2024-11-09 22:17:57,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569898916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:17:57,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71176057] [2024-11-09 22:17:57,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 22:17:57,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:17:57,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:17:57,010 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-09 22:17:57,011 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-09 22:17:57,068 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 22:17:57,068 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:17:57,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 22:17:57,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:17:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 52 proven. 54 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-09 22:17:57,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:17:57,608 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2024-11-09 22:17:57,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71176057] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 22:17:57,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 22:17:57,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 13] total 22 [2024-11-09 22:17:57,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986676975] [2024-11-09 22:17:57,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:17:57,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 22:17:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:57,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 22:17:57,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2024-11-09 22:17:57,611 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 22:17:57,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:57,703 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2024-11-09 22:17:57,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:17:57,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 129 [2024-11-09 22:17:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:57,705 INFO L225 Difference]: With dead ends: 100 [2024-11-09 22:17:57,708 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 22:17:57,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 286 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2024-11-09 22:17:57,709 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:57,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 112 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 22:17:57,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 22:17:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 22:17:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 22:17:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2024-11-09 22:17:57,722 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 129 [2024-11-09 22:17:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:57,722 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2024-11-09 22:17:57,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 22:17:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2024-11-09 22:17:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 22:17:57,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:57,724 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:57,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 22:17:57,928 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,SelfDestructingSolverStorable8 [2024-11-09 22:17:57,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:57,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1655917283, now seen corresponding path program 3 times [2024-11-09 22:17:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:57,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659136137] [2024-11-09 22:17:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:17:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:17:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 22:17:58,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 22:17:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 22:17:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 22:17:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 22:17:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 22:17:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 22:17:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:17:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 22:17:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 22:17:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 22:17:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 22:17:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 22:17:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:17:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 22:17:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 22:17:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 22:17:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 22:17:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:17:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 22:17:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 52 proven. 60 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-09 22:17:58,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659136137] [2024-11-09 22:17:58,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659136137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:17:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659263886] [2024-11-09 22:17:58,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 22:17:58,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:17:58,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:17:58,174 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-09 22:17:58,175 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-09 22:17:58,206 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 22:17:58,206 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:17:58,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 22:17:58,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:17:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-11-09 22:17:58,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:17:58,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659263886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:17:58,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:17:58,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-11-09 22:17:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373499349] [2024-11-09 22:17:58,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:17:58,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 22:17:58,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:58,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 22:17:58,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-09 22:17:58,270 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 22:17:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:58,317 INFO L93 Difference]: Finished difference Result 112 states and 143 transitions. [2024-11-09 22:17:58,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 22:17:58,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 134 [2024-11-09 22:17:58,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:58,320 INFO L225 Difference]: With dead ends: 112 [2024-11-09 22:17:58,320 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 22:17:58,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-09 22:17:58,321 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:58,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 112 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:17:58,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 22:17:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 22:17:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 60 states have internal predecessors, (62), 39 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-09 22:17:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 140 transitions. [2024-11-09 22:17:58,338 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 140 transitions. Word has length 134 [2024-11-09 22:17:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:58,339 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 140 transitions. [2024-11-09 22:17:58,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 22:17:58,339 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2024-11-09 22:17:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 22:17:58,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:17:58,340 INFO L215 NwaCegarLoop]: trace histogram [27, 26, 26, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:58,355 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-09 22:17:58,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:17:58,547 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:17:58,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:17:58,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1203852550, now seen corresponding path program 4 times [2024-11-09 22:17:58,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:17:58,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569747973] [2024-11-09 22:17:58,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:17:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:17:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:17:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 22:17:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 22:17:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 22:17:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 22:17:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 22:17:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 22:17:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 22:17:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 22:17:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 22:17:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 22:17:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 22:17:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 22:17:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 22:17:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 22:17:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:17:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 22:17:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 22:17:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 22:17:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 22:17:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:17:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 22:17:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 22:17:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 22:17:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-09 22:17:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 22:17:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:17:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 60 proven. 88 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2024-11-09 22:17:58,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:17:58,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569747973] [2024-11-09 22:17:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569747973] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:17:58,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942256461] [2024-11-09 22:17:58,795 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 22:17:58,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:17:58,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:17:58,798 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-09 22:17:58,802 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-09 22:17:58,854 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 22:17:58,855 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 22:17:58,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 22:17:58,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:17:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 84 proven. 67 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-09 22:17:59,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:17:59,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1451 backedges. 52 proven. 94 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2024-11-09 22:17:59,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942256461] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:17:59,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:17:59,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 23 [2024-11-09 22:17:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262844121] [2024-11-09 22:17:59,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:17:59,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 22:17:59,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:17:59,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 22:17:59,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-11-09 22:17:59,297 INFO L87 Difference]: Start difference. First operand 109 states and 140 transitions. Second operand has 23 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 13 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 13 states have call predecessors, (50), 13 states have call successors, (50) [2024-11-09 22:17:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:17:59,693 INFO L93 Difference]: Finished difference Result 187 states and 259 transitions. [2024-11-09 22:17:59,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 22:17:59,693 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 13 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 13 states have call predecessors, (50), 13 states have call successors, (50) Word has length 156 [2024-11-09 22:17:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:17:59,694 INFO L225 Difference]: With dead ends: 187 [2024-11-09 22:17:59,694 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 22:17:59,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 349 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 22:17:59,696 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:17:59,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 150 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 22:17:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 22:17:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 22:17:59,696 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-09 22:17:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 22:17:59,697 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 156 [2024-11-09 22:17:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:17:59,697 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 22:17:59,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 21 states have internal predecessors, (55), 13 states have call successors, (53), 3 states have call predecessors, (53), 1 states have return successors, (50), 13 states have call predecessors, (50), 13 states have call successors, (50) [2024-11-09 22:17:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 22:17:59,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 22:17:59,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 22:17:59,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 22:17:59,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:17:59,906 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:17:59,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 22:18:00,466 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 22:18:00,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:18:00 BoogieIcfgContainer [2024-11-09 22:18:00,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 22:18:00,481 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 22:18:00,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 22:18:00,481 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 22:18:00,481 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:17:54" (3/4) ... [2024-11-09 22:18:00,483 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 22:18:00,486 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-09 22:18:00,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 22:18:00,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 22:18:00,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 22:18:00,489 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 22:18:00,546 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 22:18:00,547 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 22:18:00,547 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 22:18:00,547 INFO L158 Benchmark]: Toolchain (without parser) took 6420.54ms. Allocated memory was 205.5MB in the beginning and 364.9MB in the end (delta: 159.4MB). Free memory was 132.7MB in the beginning and 279.6MB in the end (delta: -147.0MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-09 22:18:00,547 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 205.5MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:18:00,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.74ms. Allocated memory is still 205.5MB. Free memory was 132.4MB in the beginning and 120.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:18:00,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.10ms. Allocated memory is still 205.5MB. Free memory was 120.1MB in the beginning and 118.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 22:18:00,548 INFO L158 Benchmark]: Boogie Preprocessor took 20.25ms. Allocated memory is still 205.5MB. Free memory was 118.6MB in the beginning and 117.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 22:18:00,548 INFO L158 Benchmark]: IcfgBuilder took 249.83ms. Allocated memory is still 205.5MB. Free memory was 117.3MB in the beginning and 106.2MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 22:18:00,548 INFO L158 Benchmark]: TraceAbstraction took 5827.34ms. Allocated memory was 205.5MB in the beginning and 364.9MB in the end (delta: 159.4MB). Free memory was 105.7MB in the beginning and 283.8MB in the end (delta: -178.1MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. [2024-11-09 22:18:00,549 INFO L158 Benchmark]: Witness Printer took 66.16ms. Allocated memory is still 364.9MB. Free memory was 283.8MB in the beginning and 279.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 22:18:00,550 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.20ms. Allocated memory is still 205.5MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.74ms. Allocated memory is still 205.5MB. Free memory was 132.4MB in the beginning and 120.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.10ms. Allocated memory is still 205.5MB. Free memory was 120.1MB in the beginning and 118.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.25ms. Allocated memory is still 205.5MB. Free memory was 118.6MB in the beginning and 117.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 249.83ms. Allocated memory is still 205.5MB. Free memory was 117.3MB in the beginning and 106.2MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5827.34ms. Allocated memory was 205.5MB in the beginning and 364.9MB in the end (delta: 159.4MB). Free memory was 105.7MB in the beginning and 283.8MB in the end (delta: -178.1MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. * Witness Printer took 66.16ms. Allocated memory is still 364.9MB. Free memory was 283.8MB in the beginning and 279.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: 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 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 11, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 101 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 1088 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 791 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 297 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1164 GetRequests, 1044 SyntacticMatches, 13 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=10, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1151 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1503 ConstructedInterpolants, 0 QuantifiedInterpolants, 2709 SizeOfPredicates, 4 NumberOfNonLiveVariables, 797 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 10070/10475 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: 16]: Location Invariant Derived location invariant: null - InvariantResult [Line: 18]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-11-09 22:18:00,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE