./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f094e7ea34d2025ab25ab51a4a0b06d8f845826c76dbd06e91f3d4a761fa19b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:36:29,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:36:29,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:36:29,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:36:29,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:36:29,713 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:36:29,714 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:36:29,714 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:36:29,715 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:36:29,716 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:36:29,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:36:29,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:36:29,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:36:29,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:36:29,720 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:36:29,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:36:29,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:36:29,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:36:29,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:36:29,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:36:29,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:36:29,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:36:29,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:36:29,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:36:29,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:36:29,725 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:36:29,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:36:29,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:36:29,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:36:29,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:36:29,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:36:29,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:36:29,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:36:29,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:36:29,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:36:29,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:36:29,728 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:36:29,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:36:29,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:36:29,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:36:29,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:36:29,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:36:29,731 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 -> 5f094e7ea34d2025ab25ab51a4a0b06d8f845826c76dbd06e91f3d4a761fa19b [2024-11-08 14:36:29,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:36:30,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:36:30,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:36:30,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:36:30,013 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:36:30,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c [2024-11-08 14:36:31,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:36:31,633 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:36:31,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound5.c [2024-11-08 14:36:31,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b9d605c/8cc02801cb514eb5ba5e7c3c7236e940/FLAG5094e1ef5 [2024-11-08 14:36:31,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58b9d605c/8cc02801cb514eb5ba5e7c3c7236e940 [2024-11-08 14:36:31,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:36:31,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:36:31,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:36:31,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:36:31,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:36:31,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fba0097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31, skipping insertion in model container [2024-11-08 14:36:31,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:36:31,875 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/nla-digbench-scaling/hard2_unwindbound5.c[526,539] [2024-11-08 14:36:31,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:36:31,898 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:36:31,911 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/nla-digbench-scaling/hard2_unwindbound5.c[526,539] [2024-11-08 14:36:31,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:36:31,931 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:36:31,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31 WrapperNode [2024-11-08 14:36:31,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:36:31,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:36:31,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:36:31,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:36:31,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,962 INFO L138 Inliner]: procedures = 14, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2024-11-08 14:36:31,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:36:31,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:36:31,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:36:31,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:36:31,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,986 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 14:36:31,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:31,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:36:31,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:36:31,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:36:31,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:36:31,999 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (1/1) ... [2024-11-08 14:36:32,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:36:32,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:32,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 14:36:32,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 14:36:32,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:36:32,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:36:32,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:36:32,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:36:32,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:36:32,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 14:36:32,076 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 14:36:32,128 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:36:32,129 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:36:32,262 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-11-08 14:36:32,262 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:36:32,272 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:36:32,272 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 14:36:32,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:36:32 BoogieIcfgContainer [2024-11-08 14:36:32,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:36:32,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:36:32,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:36:32,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:36:32,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:36:31" (1/3) ... [2024-11-08 14:36:32,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150faf10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:36:32, skipping insertion in model container [2024-11-08 14:36:32,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:36:31" (2/3) ... [2024-11-08 14:36:32,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150faf10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:36:32, skipping insertion in model container [2024-11-08 14:36:32,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:36:32" (3/3) ... [2024-11-08 14:36:32,279 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound5.c [2024-11-08 14:36:32,292 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:36:32,292 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:36:32,337 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:36:32,342 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;@238036aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:36:32,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:36:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-08 14:36:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 14:36:32,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:32,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:32,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:32,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:32,357 INFO L85 PathProgramCache]: Analyzing trace with hash 643118537, now seen corresponding path program 1 times [2024-11-08 14:36:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:32,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094761151] [2024-11-08 14:36:32,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:32,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:36:32,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:32,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094761151] [2024-11-08 14:36:32,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094761151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:36:32,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:36:32,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 14:36:32,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043797284] [2024-11-08 14:36:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:36:32,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 14:36:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:32,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 14:36:32,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 14:36:32,520 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-08 14:36:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:32,538 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2024-11-08 14:36:32,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 14:36:32,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2024-11-08 14:36:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:32,545 INFO L225 Difference]: With dead ends: 50 [2024-11-08 14:36:32,546 INFO L226 Difference]: Without dead ends: 22 [2024-11-08 14:36:32,548 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-08 14:36:32,551 INFO L432 NwaCegarLoop]: 36 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, 36 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-08 14:36:32,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:36:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-08 14:36:32,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-08 14:36:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:36:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2024-11-08 14:36:32,581 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 8 [2024-11-08 14:36:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:32,581 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2024-11-08 14:36:32,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-08 14:36:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2024-11-08 14:36:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 14:36:32,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:32,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:32,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:36:32,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:32,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash 181060127, now seen corresponding path program 1 times [2024-11-08 14:36:32,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:32,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306459971] [2024-11-08 14:36:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:32,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:36:32,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:32,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306459971] [2024-11-08 14:36:32,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306459971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:36:32,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:36:32,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:36:32,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365179546] [2024-11-08 14:36:32,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:36:32,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:36:32,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:32,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:36:32,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:36:32,813 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-08 14:36:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:32,880 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2024-11-08 14:36:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:36:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2024-11-08 14:36:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:32,882 INFO L225 Difference]: With dead ends: 36 [2024-11-08 14:36:32,882 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 14:36:32,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:36:32,884 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:32,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:36:32,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 14:36:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2024-11-08 14:36:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:36:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-11-08 14:36:32,898 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 8 [2024-11-08 14:36:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:32,898 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-11-08 14:36:32,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-08 14:36:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-11-08 14:36:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 14:36:32,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:32,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:32,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:36:32,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:32,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:32,901 INFO L85 PathProgramCache]: Analyzing trace with hash -712280900, now seen corresponding path program 1 times [2024-11-08 14:36:32,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:32,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722018859] [2024-11-08 14:36:32,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:32,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:36:32,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:32,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722018859] [2024-11-08 14:36:32,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722018859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:36:32,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:36:32,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:36:32,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154800938] [2024-11-08 14:36:32,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:36:32,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 14:36:32,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:32,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 14:36:32,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:36:32,973 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-08 14:36:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:32,998 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2024-11-08 14:36:32,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 14:36:33,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-08 14:36:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:33,001 INFO L225 Difference]: With dead ends: 42 [2024-11-08 14:36:33,001 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 14:36:33,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:36:33,003 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:33,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:36:33,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 14:36:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 14:36:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:36:33,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-11-08 14:36:33,012 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2024-11-08 14:36:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:33,014 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-11-08 14:36:33,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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-08 14:36:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-11-08 14:36:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 14:36:33,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:33,015 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:33,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:36:33,015 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:33,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2036073049, now seen corresponding path program 1 times [2024-11-08 14:36:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:33,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807778206] [2024-11-08 14:36:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:33,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:36:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:36:33,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:33,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807778206] [2024-11-08 14:36:33,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807778206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:36:33,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:36:33,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:36:33,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696465731] [2024-11-08 14:36:33,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:36:33,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:36:33,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:33,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:36:33,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:36:33,141 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-08 14:36:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:33,197 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-11-08 14:36:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:36:33,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 13 [2024-11-08 14:36:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:33,199 INFO L225 Difference]: With dead ends: 42 [2024-11-08 14:36:33,199 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 14:36:33,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:36:33,201 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:33,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 94 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:36:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 14:36:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2024-11-08 14:36:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 14:36:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-11-08 14:36:33,216 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2024-11-08 14:36:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:33,216 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-11-08 14:36:33,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-08 14:36:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-11-08 14:36:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:36:33,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:33,218 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:33,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 14:36:33,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:33,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash 380169759, now seen corresponding path program 1 times [2024-11-08 14:36:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:33,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137988679] [2024-11-08 14:36:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:33,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:36:33,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1766581819] [2024-11-08 14:36:33,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:33,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:33,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:33,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:33,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 14:36:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:33,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 14:36:33,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:33,425 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-08 14:36:33,426 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:36:33,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:33,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137988679] [2024-11-08 14:36:33,427 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:36:33,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766581819] [2024-11-08 14:36:33,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766581819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:36:33,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:36:33,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:36:33,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539458086] [2024-11-08 14:36:33,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:36:33,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:36:33,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:36:33,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:36:33,430 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-08 14:36:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:33,502 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2024-11-08 14:36:33,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:36:33,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 18 [2024-11-08 14:36:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:33,504 INFO L225 Difference]: With dead ends: 61 [2024-11-08 14:36:33,505 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 14:36:33,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:36:33,507 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:33,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:36:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 14:36:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 14:36:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-08 14:36:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2024-11-08 14:36:33,522 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2024-11-08 14:36:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:33,522 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2024-11-08 14:36:33,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-08 14:36:33,523 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2024-11-08 14:36:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-08 14:36:33,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:33,524 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-08 14:36:33,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 14:36:33,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:33,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:33,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash -461064832, now seen corresponding path program 1 times [2024-11-08 14:36:33,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:33,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39441381] [2024-11-08 14:36:33,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:36:33,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688545455] [2024-11-08 14:36:33,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:33,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:33,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:33,759 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:33,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 14:36:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:33,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 14:36:33,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 14:36:33,938 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:36:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 14:36:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39441381] [2024-11-08 14:36:34,113 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:36:34,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688545455] [2024-11-08 14:36:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688545455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:36:34,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:36:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-11-08 14:36:34,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381467753] [2024-11-08 14:36:34,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:36:34,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:36:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:34,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:36:34,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:36:34,116 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 14:36:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:34,233 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2024-11-08 14:36:34,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:36:34,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 26 [2024-11-08 14:36:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:34,235 INFO L225 Difference]: With dead ends: 60 [2024-11-08 14:36:34,235 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 14:36:34,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:36:34,236 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:34,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 122 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:36:34,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 14:36:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-11-08 14:36:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 14:36:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2024-11-08 14:36:34,256 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 26 [2024-11-08 14:36:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:34,256 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2024-11-08 14:36:34,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 14:36:34,258 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2024-11-08 14:36:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 14:36:34,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:34,259 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:34,275 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-08 14:36:34,463 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,SelfDestructingSolverStorable5 [2024-11-08 14:36:34,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:34,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash -909290541, now seen corresponding path program 1 times [2024-11-08 14:36:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675721388] [2024-11-08 14:36:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:36:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:34,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:36:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:34,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:36:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:34,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 14:36:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 14:36:34,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675721388] [2024-11-08 14:36:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675721388] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:36:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528727840] [2024-11-08 14:36:34,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:34,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:34,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:34,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:34,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 14:36:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:34,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 14:36:34,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:34,816 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 14:36:34,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:36:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 14:36:34,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528727840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:36:34,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:36:34,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-11-08 14:36:34,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945307600] [2024-11-08 14:36:34,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:36:34,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:36:34,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:34,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:36:34,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:36:34,884 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-08 14:36:35,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:35,053 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2024-11-08 14:36:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:36:35,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 33 [2024-11-08 14:36:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:35,057 INFO L225 Difference]: With dead ends: 155 [2024-11-08 14:36:35,059 INFO L226 Difference]: Without dead ends: 130 [2024-11-08 14:36:35,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:36:35,061 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 56 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:35,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 170 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:36:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-08 14:36:35,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2024-11-08 14:36:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 83 states have internal predecessors, (95), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 14:36:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2024-11-08 14:36:35,088 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 33 [2024-11-08 14:36:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:35,088 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2024-11-08 14:36:35,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-08 14:36:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2024-11-08 14:36:35,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 14:36:35,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:35,090 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:35,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 14:36:35,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:35,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:35,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:35,292 INFO L85 PathProgramCache]: Analyzing trace with hash 252591112, now seen corresponding path program 1 times [2024-11-08 14:36:35,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:35,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148405044] [2024-11-08 14:36:35,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:35,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:36:35,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1496443214] [2024-11-08 14:36:35,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:35,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:35,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:35,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:35,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 14:36:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:35,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 14:36:35,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-08 14:36:35,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:36:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-08 14:36:35,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:35,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148405044] [2024-11-08 14:36:35,581 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:36:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496443214] [2024-11-08 14:36:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496443214] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 14:36:35,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:36:35,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-08 14:36:35,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116840306] [2024-11-08 14:36:35,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:36:35,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:36:35,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:35,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:36:35,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:36:35,583 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 14:36:36,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-08 14:36:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:36,811 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2024-11-08 14:36:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:36:36,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 36 [2024-11-08 14:36:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:36,814 INFO L225 Difference]: With dead ends: 146 [2024-11-08 14:36:36,815 INFO L226 Difference]: Without dead ends: 140 [2024-11-08 14:36:36,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:36:36,816 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:36,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 14:36:36,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-08 14:36:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 132. [2024-11-08 14:36:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 14:36:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 155 transitions. [2024-11-08 14:36:36,847 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 155 transitions. Word has length 36 [2024-11-08 14:36:36,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:36,847 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 155 transitions. [2024-11-08 14:36:36,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-08 14:36:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 155 transitions. [2024-11-08 14:36:36,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 14:36:36,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:36,849 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:36,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 14:36:37,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:37,054 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:37,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1776130969, now seen corresponding path program 1 times [2024-11-08 14:36:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:37,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185854063] [2024-11-08 14:36:37,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:36:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:36:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:36:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:36:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 14:36:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 14:36:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-08 14:36:37,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:37,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185854063] [2024-11-08 14:36:37,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185854063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:36:37,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:36:37,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:36:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063074252] [2024-11-08 14:36:37,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:36:37,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:36:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:37,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:36:37,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:36:37,147 INFO L87 Difference]: Start difference. First operand 132 states and 155 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 14:36:37,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:37,186 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2024-11-08 14:36:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 14:36:37,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-11-08 14:36:37,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:37,187 INFO L225 Difference]: With dead ends: 137 [2024-11-08 14:36:37,188 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 14:36:37,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:36:37,189 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:37,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:36:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 14:36:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-08 14:36:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 80 states have internal predecessors, (91), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 14:36:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2024-11-08 14:36:37,206 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 42 [2024-11-08 14:36:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:37,207 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2024-11-08 14:36:37,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 14:36:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2024-11-08 14:36:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 14:36:37,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:37,213 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:37,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 14:36:37,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:37,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1605675221, now seen corresponding path program 1 times [2024-11-08 14:36:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:37,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957384026] [2024-11-08 14:36:37,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:37,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:36:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:36:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:36:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:36:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 14:36:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:36:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:36:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 14:36:37,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957384026] [2024-11-08 14:36:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957384026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:36:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961147634] [2024-11-08 14:36:37,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:37,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:37,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:37,364 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:37,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 14:36:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:37,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 14:36:37,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 14:36:37,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:36:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 14:36:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961147634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:36:37,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:36:37,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 11 [2024-11-08 14:36:37,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190278732] [2024-11-08 14:36:37,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:36:37,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 14:36:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:37,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 14:36:37,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:36:37,564 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 14:36:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:37,702 INFO L93 Difference]: Finished difference Result 194 states and 232 transitions. [2024-11-08 14:36:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:36:37,703 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 49 [2024-11-08 14:36:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:37,705 INFO L225 Difference]: With dead ends: 194 [2024-11-08 14:36:37,709 INFO L226 Difference]: Without dead ends: 173 [2024-11-08 14:36:37,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:36:37,710 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:37,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 184 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:36:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-08 14:36:37,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2024-11-08 14:36:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 116 states have internal predecessors, (130), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 14:36:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 201 transitions. [2024-11-08 14:36:37,738 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 201 transitions. Word has length 49 [2024-11-08 14:36:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:37,739 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 201 transitions. [2024-11-08 14:36:37,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-08 14:36:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 201 transitions. [2024-11-08 14:36:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 14:36:37,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:37,743 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:37,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 14:36:37,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 14:36:37,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:37,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1800695307, now seen corresponding path program 1 times [2024-11-08 14:36:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:37,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753244741] [2024-11-08 14:36:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:37,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:36:37,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563556845] [2024-11-08 14:36:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:37,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:37,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:37,982 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:37,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 14:36:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:38,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-08 14:36:38,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 14:36:38,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:36:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-08 14:36:39,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:39,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753244741] [2024-11-08 14:36:39,743 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:36:39,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563556845] [2024-11-08 14:36:39,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563556845] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:36:39,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:36:39,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-08 14:36:39,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390983266] [2024-11-08 14:36:39,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:36:39,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 14:36:39,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:39,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 14:36:39,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:36:39,748 INFO L87 Difference]: Start difference. First operand 168 states and 201 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-08 14:36:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:40,479 INFO L93 Difference]: Finished difference Result 261 states and 330 transitions. [2024-11-08 14:36:40,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 14:36:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 58 [2024-11-08 14:36:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:40,481 INFO L225 Difference]: With dead ends: 261 [2024-11-08 14:36:40,482 INFO L226 Difference]: Without dead ends: 223 [2024-11-08 14:36:40,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:36:40,483 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 47 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:40,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 239 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 14:36:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-08 14:36:40,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 210. [2024-11-08 14:36:40,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 141 states have (on average 1.2127659574468086) internal successors, (171), 148 states have internal predecessors, (171), 44 states have call successors, (44), 24 states have call predecessors, (44), 24 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 14:36:40,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 257 transitions. [2024-11-08 14:36:40,547 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 257 transitions. Word has length 58 [2024-11-08 14:36:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:40,547 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 257 transitions. [2024-11-08 14:36:40,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-11-08 14:36:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 257 transitions. [2024-11-08 14:36:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-08 14:36:40,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:40,549 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:40,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 14:36:40,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:40,752 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:40,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1688778742, now seen corresponding path program 1 times [2024-11-08 14:36:40,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:40,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299509395] [2024-11-08 14:36:40,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:40,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:36:40,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549655571] [2024-11-08 14:36:40,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:40,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:40,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:40,784 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:40,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 14:36:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:40,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 14:36:40,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-08 14:36:41,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:36:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-11-08 14:36:41,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:41,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299509395] [2024-11-08 14:36:41,703 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:36:41,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549655571] [2024-11-08 14:36:41,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549655571] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:36:41,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:36:41,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-11-08 14:36:41,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160345300] [2024-11-08 14:36:41,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:36:41,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 14:36:41,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:41,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 14:36:41,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-08 14:36:41,706 INFO L87 Difference]: Start difference. First operand 210 states and 257 transitions. Second operand has 16 states, 14 states have (on average 3.0) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-08 14:36:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:42,789 INFO L93 Difference]: Finished difference Result 262 states and 324 transitions. [2024-11-08 14:36:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:36:42,790 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.0) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 69 [2024-11-08 14:36:42,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:42,792 INFO L225 Difference]: With dead ends: 262 [2024-11-08 14:36:42,792 INFO L226 Difference]: Without dead ends: 218 [2024-11-08 14:36:42,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:36:42,793 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 25 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:42,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 264 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 14:36:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-08 14:36:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 193. [2024-11-08 14:36:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 135 states have internal predecessors, (152), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 14:36:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2024-11-08 14:36:42,842 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 69 [2024-11-08 14:36:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:42,842 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2024-11-08 14:36:42,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.0) internal successors, (42), 15 states have internal predecessors, (42), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-08 14:36:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2024-11-08 14:36:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 14:36:42,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:42,845 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:42,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 14:36:43,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:43,058 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:43,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:43,058 INFO L85 PathProgramCache]: Analyzing trace with hash -428937714, now seen corresponding path program 1 times [2024-11-08 14:36:43,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:43,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186245056] [2024-11-08 14:36:43,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:43,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:43,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:36:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:36:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:36:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:36:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 14:36:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:36:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:36:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:36:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 14:36:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 14:36:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 14:36:43,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 14:36:43,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186245056] [2024-11-08 14:36:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186245056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:36:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937143381] [2024-11-08 14:36:43,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:43,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:43,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:43,414 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:43,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 14:36:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:43,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-08 14:36:43,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 14:36:43,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:36:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-08 14:36:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937143381] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:36:44,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:36:44,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-08 14:36:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099616860] [2024-11-08 14:36:44,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:36:44,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 14:36:44,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:44,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 14:36:44,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:36:44,066 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 12 states have internal predecessors, (51), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-11-08 14:36:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:44,327 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2024-11-08 14:36:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 14:36:44,328 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 12 states have internal predecessors, (51), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 74 [2024-11-08 14:36:44,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:44,329 INFO L225 Difference]: With dead ends: 231 [2024-11-08 14:36:44,329 INFO L226 Difference]: Without dead ends: 165 [2024-11-08 14:36:44,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 162 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-08 14:36:44,331 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:44,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 308 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:36:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-08 14:36:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2024-11-08 14:36:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 108 states have (on average 1.1574074074074074) internal successors, (125), 111 states have internal predecessors, (125), 31 states have call successors, (31), 20 states have call predecessors, (31), 20 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 14:36:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2024-11-08 14:36:44,376 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 74 [2024-11-08 14:36:44,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:44,377 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2024-11-08 14:36:44,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 12 states have internal predecessors, (51), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-11-08 14:36:44,377 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2024-11-08 14:36:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 14:36:44,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:44,378 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:44,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 14:36:44,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 14:36:44,583 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:44,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:44,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1496336062, now seen corresponding path program 1 times [2024-11-08 14:36:44,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:44,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082968456] [2024-11-08 14:36:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:36:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:36:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:36:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:36:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 14:36:44,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:36:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:36:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:36:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:36:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 14:36:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 14:36:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 14:36:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 14:36:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 14:36:44,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:44,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082968456] [2024-11-08 14:36:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082968456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:36:44,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142972552] [2024-11-08 14:36:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:44,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:44,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:44,759 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:44,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 14:36:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:44,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 14:36:44,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-08 14:36:44,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:36:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 14:36:45,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142972552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:36:45,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:36:45,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 10 [2024-11-08 14:36:45,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228167058] [2024-11-08 14:36:45,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:36:45,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 14:36:45,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:45,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 14:36:45,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-08 14:36:45,025 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2024-11-08 14:36:45,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:45,148 INFO L93 Difference]: Finished difference Result 218 states and 264 transitions. [2024-11-08 14:36:45,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 14:36:45,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 87 [2024-11-08 14:36:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:45,150 INFO L225 Difference]: With dead ends: 218 [2024-11-08 14:36:45,151 INFO L226 Difference]: Without dead ends: 162 [2024-11-08 14:36:45,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 192 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:36:45,152 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:45,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 117 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:36:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-08 14:36:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-08 14:36:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 110 states have (on average 1.1545454545454545) internal successors, (127), 113 states have internal predecessors, (127), 31 states have call successors, (31), 20 states have call predecessors, (31), 20 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 14:36:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2024-11-08 14:36:45,200 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 87 [2024-11-08 14:36:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:45,201 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2024-11-08 14:36:45,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2024-11-08 14:36:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2024-11-08 14:36:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 14:36:45,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:45,203 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-08 14:36:45,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 14:36:45,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-08 14:36:45,408 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:45,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:45,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1611798954, now seen corresponding path program 2 times [2024-11-08 14:36:45,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:45,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638300690] [2024-11-08 14:36:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:45,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 14:36:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 14:36:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 14:36:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:36:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 14:36:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 14:36:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 14:36:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 14:36:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 14:36:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 14:36:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 14:36:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 14:36:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 14:36:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 14:36:45,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:36:45,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638300690] [2024-11-08 14:36:45,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638300690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:36:45,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400536483] [2024-11-08 14:36:45,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:36:45,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:45,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:45,615 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:45,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 14:36:45,678 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:36:45,678 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:36:45,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 14:36:45,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 322 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 14:36:45,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:36:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-08 14:36:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400536483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:36:45,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:36:45,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 11 [2024-11-08 14:36:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468078476] [2024-11-08 14:36:45,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:36:45,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 14:36:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:36:45,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 14:36:45,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 14:36:45,900 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2024-11-08 14:36:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:36:46,098 INFO L93 Difference]: Finished difference Result 209 states and 246 transitions. [2024-11-08 14:36:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:36:46,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 90 [2024-11-08 14:36:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:36:46,100 INFO L225 Difference]: With dead ends: 209 [2024-11-08 14:36:46,100 INFO L226 Difference]: Without dead ends: 155 [2024-11-08 14:36:46,101 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 198 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:36:46,101 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 28 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:36:46,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 283 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:36:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-08 14:36:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 145. [2024-11-08 14:36:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 101 states have internal predecessors, (106), 26 states have call successors, (26), 20 states have call predecessors, (26), 20 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 14:36:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2024-11-08 14:36:46,142 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 90 [2024-11-08 14:36:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:36:46,142 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2024-11-08 14:36:46,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 6 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2024-11-08 14:36:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2024-11-08 14:36:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-08 14:36:46,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:36:46,144 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:36:46,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 14:36:46,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 14:36:46,348 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:36:46,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:36:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1610071076, now seen corresponding path program 1 times [2024-11-08 14:36:46,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:36:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976601950] [2024-11-08 14:36:46,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:46,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:36:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:36:46,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446870060] [2024-11-08 14:36:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:36:46,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:36:46,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:36:46,382 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:36:46,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 14:36:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:36:46,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 14:36:46,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:36:46,916 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-08 14:36:46,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:37:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-08 14:37:00,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:37:00,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976601950] [2024-11-08 14:37:00,612 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 14:37:00,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446870060] [2024-11-08 14:37:00,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446870060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:37:00,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:37:00,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-11-08 14:37:00,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302000734] [2024-11-08 14:37:00,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:37:00,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 14:37:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:37:00,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 14:37:00,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2024-11-08 14:37:00,618 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2024-11-08 14:37:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:37:01,922 INFO L93 Difference]: Finished difference Result 188 states and 202 transitions. [2024-11-08 14:37:01,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 14:37:01,922 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) Word has length 90 [2024-11-08 14:37:01,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:37:01,925 INFO L225 Difference]: With dead ends: 188 [2024-11-08 14:37:01,925 INFO L226 Difference]: Without dead ends: 157 [2024-11-08 14:37:01,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2024-11-08 14:37:01,926 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 14:37:01,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 539 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 14:37:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-08 14:37:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 141. [2024-11-08 14:37:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 96 states have (on average 1.0729166666666667) internal successors, (103), 98 states have internal predecessors, (103), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 14:37:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2024-11-08 14:37:01,962 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 90 [2024-11-08 14:37:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:37:01,962 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2024-11-08 14:37:01,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 23 states have internal predecessors, (54), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 11 states have call predecessors, (26), 11 states have call successors, (26) [2024-11-08 14:37:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2024-11-08 14:37:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 14:37:01,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:37:01,963 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:37:01,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 14:37:02,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 14:37:02,164 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:37:02,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:37:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1390349825, now seen corresponding path program 2 times [2024-11-08 14:37:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:37:02,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076501571] [2024-11-08 14:37:02,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:37:02,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:37:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 14:37:02,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983451379] [2024-11-08 14:37:02,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:37:02,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:37:02,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:37:02,186 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:37:02,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 14:37:02,253 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:37:02,253 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-08 14:37:02,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 14:37:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 14:37:02,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 14:37:02,328 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 14:37:02,329 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 14:37:02,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 14:37:02,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 14:37:02,534 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:37:02,584 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 14:37:02,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 02:37:02 BoogieIcfgContainer [2024-11-08 14:37:02,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 14:37:02,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 14:37:02,588 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 14:37:02,588 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 14:37:02,589 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:36:32" (3/4) ... [2024-11-08 14:37:02,590 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 14:37:02,663 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 14:37:02,663 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 14:37:02,664 INFO L158 Benchmark]: Toolchain (without parser) took 30999.30ms. Allocated memory was 174.1MB in the beginning and 245.4MB in the end (delta: 71.3MB). Free memory was 116.5MB in the beginning and 107.8MB in the end (delta: 8.6MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2024-11-08 14:37:02,664 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 174.1MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:37:02,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.40ms. Allocated memory is still 174.1MB. Free memory was 116.4MB in the beginning and 103.5MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 14:37:02,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.34ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 101.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 14:37:02,665 INFO L158 Benchmark]: Boogie Preprocessor took 33.52ms. Allocated memory is still 174.1MB. Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 14:37:02,665 INFO L158 Benchmark]: RCFGBuilder took 275.47ms. Allocated memory is still 174.1MB. Free memory was 100.0MB in the beginning and 88.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 14:37:02,665 INFO L158 Benchmark]: TraceAbstraction took 30312.21ms. Allocated memory was 174.1MB in the beginning and 245.4MB in the end (delta: 71.3MB). Free memory was 87.5MB in the beginning and 112.0MB in the end (delta: -24.5MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-11-08 14:37:02,665 INFO L158 Benchmark]: Witness Printer took 75.49ms. Allocated memory is still 245.4MB. Free memory was 112.0MB in the beginning and 107.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 14:37:02,667 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.23ms. Allocated memory is still 174.1MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.40ms. Allocated memory is still 174.1MB. Free memory was 116.4MB in the beginning and 103.5MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.34ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 101.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.52ms. Allocated memory is still 174.1MB. Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 275.47ms. Allocated memory is still 174.1MB. Free memory was 100.0MB in the beginning and 88.1MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30312.21ms. Allocated memory was 174.1MB in the beginning and 245.4MB in the end (delta: 71.3MB). Free memory was 87.5MB in the beginning and 112.0MB in the end (delta: -24.5MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * Witness Printer took 75.49ms. Allocated memory is still 245.4MB. Free memory was 112.0MB in the beginning and 107.8MB in the end (delta: 4.2MB). 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] int A, B; [L25] int r, d, p, q; [L26] A = __VERIFIER_nondet_int() [L27] B = 1 [L29] r = A [L30] d = B [L31] p = 1 [L32] q = 0 VAL [A=7, B=1, counter=0, d=1, p=1, q=0, r=7] [L34] EXPR counter++ VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=1, d=1, p=1, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=1, d=2, p=2, q=0, r=7] [L34] EXPR counter++ VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=2, d=2, p=2, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=2, d=4, p=4, q=0, r=7] [L34] EXPR counter++ VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=3, d=4, p=4, q=0, r=7] [L38] COND FALSE !(!(r >= d)) [L40] d = 2 * d [L41] p = 2 * p VAL [A=7, B=1, counter=3, d=8, p=8, q=0, r=7] [L34] EXPR counter++ VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L34] COND TRUE counter++<5 [L35] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(q == 0) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L36] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(r == A) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L37] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(d == B * p) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L38] COND TRUE !(r >= d) VAL [A=7, B=1, counter=4, d=8, p=8, q=0, r=7] [L44] EXPR counter++ VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L44] COND TRUE counter++<5 [L45] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L45] RET __VERIFIER_assert(A == q*B + r) VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L46] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L46] RET __VERIFIER_assert(d == B*p) VAL [A=7, B=1, counter=5, d=8, p=8, q=0, r=7] [L48] COND FALSE !(!(p != 1)) [L50] d = d / 2 [L51] p = p / 2 VAL [A=7, B=1, counter=5, d=4, p=4, q=0, r=7] [L52] COND TRUE r >= d [L53] r = r - d [L54] q = q + p VAL [A=7, B=1, counter=5, d=4, p=4, q=4, r=3] [L44] EXPR counter++ VAL [A=7, B=1, counter=6, d=4, p=4, q=4, r=3] [L44] COND FALSE !(counter++<5) [L58] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.2s, OverallIterations: 17, TraceHistogramMax: 15, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 2839 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2286 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1841 IncrementalHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 553 mSDtfsCounter, 1841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1416 GetRequests, 1246 SyntacticMatches, 18 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210occurred in iteration=11, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 106 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 1529 NumberOfCodeBlocks, 1529 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1625 ConstructedInterpolants, 0 QuantifiedInterpolants, 16583 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1817 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 4363/5079 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 14:37:02,714 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE