./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 18:34:51,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 18:34:51,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 18:34:51,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 18:34:51,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 18:34:51,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 18:34:51,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 18:34:51,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 18:34:51,277 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 18:34:51,279 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 18:34:51,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 18:34:51,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 18:34:51,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 18:34:51,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 18:34:51,282 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 18:34:51,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 18:34:51,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 18:34:51,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 18:34:51,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 18:34:51,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 18:34:51,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 18:34:51,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 18:34:51,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 18:34:51,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 18:34:51,289 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 18:34:51,289 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 18:34:51,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 18:34:51,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 18:34:51,290 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 18:34:51,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 18:34:51,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 18:34:51,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 18:34:51,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:34:51,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 18:34:51,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 18:34:51,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 18:34:51,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 18:34:51,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 18:34:51,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 18:34:51,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 18:34:51,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 18:34:51,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 18:34:51,294 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb [2024-10-12 18:34:51,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 18:34:51,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 18:34:51,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 18:34:51,595 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 18:34:51,596 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 18:34:51,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-10-12 18:34:53,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 18:34:53,211 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 18:34:53,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-10-12 18:34:53,219 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb10b50f7/f0b91d9454bd46d395f0cc224b7c5012/FLAGa334e0ee0 [2024-10-12 18:34:53,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb10b50f7/f0b91d9454bd46d395f0cc224b7c5012 [2024-10-12 18:34:53,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 18:34:53,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 18:34:53,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 18:34:53,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 18:34:53,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 18:34:53,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e68bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53, skipping insertion in model container [2024-10-12 18:34:53,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 18:34:53,791 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i[799,812] [2024-10-12 18:34:53,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:34:53,814 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 18:34:53,826 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/hh2012-ex3.i[799,812] [2024-10-12 18:34:53,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 18:34:53,844 INFO L204 MainTranslator]: Completed translation [2024-10-12 18:34:53,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53 WrapperNode [2024-10-12 18:34:53,845 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 18:34:53,846 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 18:34:53,846 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 18:34:53,846 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 18:34:53,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,871 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-10-12 18:34:53,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 18:34:53,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 18:34:53,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 18:34:53,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 18:34:53,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,893 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 18:34:53,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,894 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,902 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 18:34:53,903 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 18:34:53,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 18:34:53,904 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 18:34:53,904 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (1/1) ... [2024-10-12 18:34:53,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 18:34:53,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:34:53,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 18:34:53,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 18:34:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 18:34:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 18:34:53,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 18:34:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 18:34:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-12 18:34:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-12 18:34:54,049 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 18:34:54,051 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 18:34:54,171 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-10-12 18:34:54,172 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 18:34:54,199 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 18:34:54,200 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-12 18:34:54,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:34:54 BoogieIcfgContainer [2024-10-12 18:34:54,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 18:34:54,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 18:34:54,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 18:34:54,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 18:34:54,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 06:34:53" (1/3) ... [2024-10-12 18:34:54,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b51752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:34:54, skipping insertion in model container [2024-10-12 18:34:54,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 06:34:53" (2/3) ... [2024-10-12 18:34:54,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b51752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 06:34:54, skipping insertion in model container [2024-10-12 18:34:54,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:34:54" (3/3) ... [2024-10-12 18:34:54,212 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-10-12 18:34:54,229 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 18:34:54,230 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 18:34:54,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 18:34:54,300 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;@7974e338, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 18:34:54,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 18:34:54,304 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 18:34:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:34:54,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:54,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:54,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:54,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1998107271, now seen corresponding path program 1 times [2024-10-12 18:34:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:54,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453294144] [2024-10-12 18:34:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:34:54,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:54,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453294144] [2024-10-12 18:34:54,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453294144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:54,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:34:54,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 18:34:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146390990] [2024-10-12 18:34:54,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:54,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 18:34:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:54,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 18:34:54,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:34:54,529 INFO L87 Difference]: Start difference. First operand has 20 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 11 states have internal predecessors, (15), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-12 18:34:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:54,567 INFO L93 Difference]: Finished difference Result 40 states and 72 transitions. [2024-10-12 18:34:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 18:34:54,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-10-12 18:34:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:54,595 INFO L225 Difference]: With dead ends: 40 [2024-10-12 18:34:54,596 INFO L226 Difference]: Without dead ends: 19 [2024-10-12 18:34:54,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 18:34:54,606 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:54,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-12 18:34:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-12 18:34:54,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 18:34:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2024-10-12 18:34:54,677 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 7 [2024-10-12 18:34:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:54,678 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2024-10-12 18:34:54,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-12 18:34:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2024-10-12 18:34:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-12 18:34:54,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:54,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:54,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 18:34:54,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:54,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1996498557, now seen corresponding path program 1 times [2024-10-12 18:34:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:54,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281648723] [2024-10-12 18:34:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:34:54,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:54,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281648723] [2024-10-12 18:34:54,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281648723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:54,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:34:54,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:34:54,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509772661] [2024-10-12 18:34:54,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:54,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:34:54,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:54,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:34:54,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:34:54,818 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-10-12 18:34:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:54,929 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-10-12 18:34:54,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:34:54,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 7 [2024-10-12 18:34:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:54,930 INFO L225 Difference]: With dead ends: 25 [2024-10-12 18:34:54,930 INFO L226 Difference]: Without dead ends: 23 [2024-10-12 18:34:54,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:34:54,932 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:54,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:34:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-12 18:34:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-12 18:34:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-12 18:34:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-12 18:34:54,948 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 7 [2024-10-12 18:34:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:54,949 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-12 18:34:54,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-10-12 18:34:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-10-12 18:34:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 18:34:54,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:54,950 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:54,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 18:34:54,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2106031398, now seen corresponding path program 1 times [2024-10-12 18:34:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782865476] [2024-10-12 18:34:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 18:34:55,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:55,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782865476] [2024-10-12 18:34:55,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782865476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:55,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:34:55,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:34:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115699111] [2024-10-12 18:34:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:55,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:34:55,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:55,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:34:55,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:34:55,127 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-10-12 18:34:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:55,238 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2024-10-12 18:34:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:34:55,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 12 [2024-10-12 18:34:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:55,240 INFO L225 Difference]: With dead ends: 41 [2024-10-12 18:34:55,240 INFO L226 Difference]: Without dead ends: 39 [2024-10-12 18:34:55,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:34:55,242 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:55,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:34:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-12 18:34:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-10-12 18:34:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 18:34:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-10-12 18:34:55,259 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 12 [2024-10-12 18:34:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:55,260 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-10-12 18:34:55,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-10-12 18:34:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-10-12 18:34:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 18:34:55,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:55,261 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:55,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 18:34:55,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:55,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2121220317, now seen corresponding path program 1 times [2024-10-12 18:34:55,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:55,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101935826] [2024-10-12 18:34:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:55,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:34:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 18:34:55,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:55,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101935826] [2024-10-12 18:34:55,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101935826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:55,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:34:55,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 18:34:55,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319725626] [2024-10-12 18:34:55,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:55,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:34:55,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:55,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:34:55,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:34:55,398 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-10-12 18:34:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:55,502 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-10-12 18:34:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 18:34:55,506 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 17 [2024-10-12 18:34:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:55,507 INFO L225 Difference]: With dead ends: 45 [2024-10-12 18:34:55,507 INFO L226 Difference]: Without dead ends: 43 [2024-10-12 18:34:55,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 18:34:55,508 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:55,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:34:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-12 18:34:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-10-12 18:34:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-12 18:34:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2024-10-12 18:34:55,527 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 17 [2024-10-12 18:34:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:55,528 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2024-10-12 18:34:55,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-10-12 18:34:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2024-10-12 18:34:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 18:34:55,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:55,529 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:55,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 18:34:55,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:55,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:55,530 INFO L85 PathProgramCache]: Analyzing trace with hash 905923334, now seen corresponding path program 1 times [2024-10-12 18:34:55,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:55,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993123056] [2024-10-12 18:34:55,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:55,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:34:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 18:34:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,692 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 18:34:55,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:55,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993123056] [2024-10-12 18:34:55,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993123056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:55,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:34:55,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 18:34:55,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457493396] [2024-10-12 18:34:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:55,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:34:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:55,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:34:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:34:55,695 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-10-12 18:34:55,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:55,762 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2024-10-12 18:34:55,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:34:55,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 22 [2024-10-12 18:34:55,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:55,767 INFO L225 Difference]: With dead ends: 88 [2024-10-12 18:34:55,767 INFO L226 Difference]: Without dead ends: 55 [2024-10-12 18:34:55,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:34:55,770 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:55,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-12 18:34:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-12 18:34:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 18:34:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2024-10-12 18:34:55,791 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 22 [2024-10-12 18:34:55,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:55,791 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2024-10-12 18:34:55,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-10-12 18:34:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2024-10-12 18:34:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-12 18:34:55,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:55,794 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-12 18:34:55,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 18:34:55,794 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:55,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1205745070, now seen corresponding path program 1 times [2024-10-12 18:34:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:55,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453674965] [2024-10-12 18:34:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:55,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:34:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 18:34:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 18:34:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:34:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 18:34:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:55,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 18:34:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-10-12 18:34:56,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:56,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453674965] [2024-10-12 18:34:56,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453674965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:56,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 18:34:56,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 18:34:56,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319002786] [2024-10-12 18:34:56,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:56,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:34:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:56,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:34:56,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 18:34:56,017 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 18:34:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:56,078 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-10-12 18:34:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:34:56,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2024-10-12 18:34:56,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:56,081 INFO L225 Difference]: With dead ends: 61 [2024-10-12 18:34:56,081 INFO L226 Difference]: Without dead ends: 59 [2024-10-12 18:34:56,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 18:34:56,082 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:56,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-12 18:34:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-12 18:34:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-12 18:34:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2024-10-12 18:34:56,095 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 43 [2024-10-12 18:34:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:56,095 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2024-10-12 18:34:56,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 18:34:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2024-10-12 18:34:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 18:34:56,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:56,098 INFO L215 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:56,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 18:34:56,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:56,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:56,099 INFO L85 PathProgramCache]: Analyzing trace with hash 296191259, now seen corresponding path program 1 times [2024-10-12 18:34:56,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:56,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553178227] [2024-10-12 18:34:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:56,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:34:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 18:34:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 18:34:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:34:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 18:34:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 18:34:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 18:34:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 18:34:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 18:34:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:34:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 18:34:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 18:34:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,268 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-12 18:34:56,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553178227] [2024-10-12 18:34:56,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553178227] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:34:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747865151] [2024-10-12 18:34:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:56,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:34:56,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:34:56,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:34:56,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 18:34:56,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:56,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 18:34:56,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:34:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 184 proven. 7 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-10-12 18:34:56,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:34:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-12 18:34:56,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747865151] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 18:34:56,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 18:34:56,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-12 18:34:56,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262486185] [2024-10-12 18:34:56,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 18:34:56,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 18:34:56,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:56,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 18:34:56,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:34:56,537 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-12 18:34:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:56,605 INFO L93 Difference]: Finished difference Result 125 states and 174 transitions. [2024-10-12 18:34:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:34:56,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 77 [2024-10-12 18:34:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:56,607 INFO L225 Difference]: With dead ends: 125 [2024-10-12 18:34:56,609 INFO L226 Difference]: Without dead ends: 79 [2024-10-12 18:34:56,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-12 18:34:56,610 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:56,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-12 18:34:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-12 18:34:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 39 states have call successors, (39), 6 states have call predecessors, (39), 6 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-12 18:34:56,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2024-10-12 18:34:56,638 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 77 [2024-10-12 18:34:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:56,641 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2024-10-12 18:34:56,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-12 18:34:56,641 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2024-10-12 18:34:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 18:34:56,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:56,647 INFO L215 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:56,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 18:34:56,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:34:56,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:56,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1649128037, now seen corresponding path program 2 times [2024-10-12 18:34:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:56,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494808968] [2024-10-12 18:34:56,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:56,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:34:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 18:34:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 18:34:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:34:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 18:34:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 18:34:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 18:34:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 18:34:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 18:34:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:34:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 18:34:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 18:34:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 18:34:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 18:34:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 18:34:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 18:34:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 18:34:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 18:34:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 18:34:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 18:34:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2024-10-12 18:34:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494808968] [2024-10-12 18:34:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494808968] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:34:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636876890] [2024-10-12 18:34:57,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 18:34:57,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:34:57,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:34:57,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:34:57,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 18:34:57,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 18:34:57,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:34:57,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-12 18:34:57,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:34:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 49 proven. 41 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-12 18:34:57,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:34:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2024-10-12 18:34:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636876890] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 18:34:57,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:34:57,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 13] total 22 [2024-10-12 18:34:57,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152756517] [2024-10-12 18:34:57,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:57,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 18:34:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:57,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 18:34:57,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2024-10-12 18:34:57,987 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 18:34:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:58,076 INFO L93 Difference]: Finished difference Result 85 states and 119 transitions. [2024-10-12 18:34:58,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:34:58,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 119 [2024-10-12 18:34:58,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:58,078 INFO L225 Difference]: With dead ends: 85 [2024-10-12 18:34:58,079 INFO L226 Difference]: Without dead ends: 83 [2024-10-12 18:34:58,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 265 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2024-10-12 18:34:58,082 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:58,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 18:34:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-12 18:34:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-12 18:34:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 37 states have internal predecessors, (39), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-12 18:34:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-10-12 18:34:58,099 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 119 [2024-10-12 18:34:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:58,099 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-10-12 18:34:58,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-12 18:34:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-10-12 18:34:58,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 18:34:58,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:58,102 INFO L215 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:58,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 18:34:58,302 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,SelfDestructingSolverStorable7 [2024-10-12 18:34:58,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:58,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1418522574, now seen corresponding path program 3 times [2024-10-12 18:34:58,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:58,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305797561] [2024-10-12 18:34:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:34:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 18:34:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 18:34:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:34:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 18:34:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 18:34:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 18:34:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 18:34:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 18:34:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:34:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 18:34:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 18:34:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 18:34:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 18:34:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 18:34:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 18:34:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 18:34:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 18:34:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 18:34:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 18:34:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 18:34:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-12 18:34:58,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305797561] [2024-10-12 18:34:58,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305797561] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:34:58,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118614338] [2024-10-12 18:34:58,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 18:34:58,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:34:58,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:34:58,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 18:34:58,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 18:34:58,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-12 18:34:58,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:34:58,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 18:34:58,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:34:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2024-10-12 18:34:58,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 18:34:58,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118614338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 18:34:58,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 18:34:58,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-10-12 18:34:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199722738] [2024-10-12 18:34:58,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:58,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 18:34:58,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:58,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 18:34:58,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-12 18:34:58,720 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 18:34:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:58,782 INFO L93 Difference]: Finished difference Result 97 states and 128 transitions. [2024-10-12 18:34:58,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 18:34:58,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 124 [2024-10-12 18:34:58,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:58,785 INFO L225 Difference]: With dead ends: 97 [2024-10-12 18:34:58,785 INFO L226 Difference]: Without dead ends: 95 [2024-10-12 18:34:58,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-10-12 18:34:58,787 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:58,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:58,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-12 18:34:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-12 18:34:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 46 states have internal predecessors, (48), 39 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-12 18:34:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 126 transitions. [2024-10-12 18:34:58,802 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 126 transitions. Word has length 124 [2024-10-12 18:34:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:58,803 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 126 transitions. [2024-10-12 18:34:58,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 18:34:58,803 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 126 transitions. [2024-10-12 18:34:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 18:34:58,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 18:34:58,808 INFO L215 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 6, 6, 6, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:58,825 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-10-12 18:34:59,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:34:59,009 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 18:34:59,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 18:34:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash 883710092, now seen corresponding path program 4 times [2024-10-12 18:34:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 18:34:59,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729398036] [2024-10-12 18:34:59,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 18:34:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 18:34:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 18:34:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 18:34:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 18:34:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 18:34:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 18:34:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 18:34:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 18:34:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 18:34:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 18:34:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 18:34:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 18:34:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 18:34:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 18:34:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 18:34:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 18:34:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 18:34:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 18:34:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 18:34:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 18:34:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 18:34:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 18:34:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 18:34:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 18:34:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 18:34:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 18:34:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-12 18:34:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 18:34:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 56 proven. 70 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2024-10-12 18:34:59,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 18:34:59,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729398036] [2024-10-12 18:34:59,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729398036] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 18:34:59,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128956162] [2024-10-12 18:34:59,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 18:34:59,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:34:59,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 18:34:59,347 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-10-12 18:34:59,349 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-10-12 18:34:59,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 18:34:59,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 18:34:59,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 18:34:59,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 18:34:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 97 proven. 76 refuted. 0 times theorem prover too weak. 1256 trivial. 0 not checked. [2024-10-12 18:34:59,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 18:34:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 1339 trivial. 0 not checked. [2024-10-12 18:34:59,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128956162] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 18:34:59,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 18:34:59,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 10] total 20 [2024-10-12 18:34:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695666453] [2024-10-12 18:34:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 18:34:59,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 18:34:59,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 18:34:59,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 18:34:59,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2024-10-12 18:34:59,694 INFO L87 Difference]: Start difference. First operand 95 states and 126 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 18:34:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 18:34:59,739 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2024-10-12 18:34:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 18:34:59,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 145 [2024-10-12 18:34:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 18:34:59,740 INFO L225 Difference]: With dead ends: 95 [2024-10-12 18:34:59,740 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 18:34:59,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-10-12 18:34:59,741 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 18:34:59,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 18:34:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 18:34:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 18:34:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 18:34:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 18:34:59,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2024-10-12 18:34:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 18:34:59,742 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 18:34:59,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 18:34:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 18:34:59,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 18:34:59,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 18:34:59,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 18:34:59,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 18:34:59,952 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-10-12 18:34:59,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 18:35:00,311 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 18:35:00,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 06:35:00 BoogieIcfgContainer [2024-10-12 18:35:00,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 18:35:00,327 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 18:35:00,327 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 18:35:00,328 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 18:35:00,328 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 06:34:54" (3/4) ... [2024-10-12 18:35:00,330 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 18:35:00,333 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-10-12 18:35:00,336 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-12 18:35:00,337 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-12 18:35:00,337 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 18:35:00,337 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 18:35:00,421 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 18:35:00,422 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 18:35:00,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 18:35:00,422 INFO L158 Benchmark]: Toolchain (without parser) took 6818.55ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 134.6MB in the beginning and 69.3MB in the end (delta: 65.3MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2024-10-12 18:35:00,422 INFO L158 Benchmark]: CDTParser took 3.64ms. Allocated memory is still 117.4MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:35:00,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.25ms. Allocated memory is still 169.9MB. Free memory was 134.6MB in the beginning and 122.2MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:35:00,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.88ms. Allocated memory is still 169.9MB. Free memory was 122.2MB in the beginning and 120.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 18:35:00,423 INFO L158 Benchmark]: Boogie Preprocessor took 30.06ms. Allocated memory is still 169.9MB. Free memory was 120.9MB in the beginning and 119.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 18:35:00,423 INFO L158 Benchmark]: RCFGBuilder took 297.86ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 108.4MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 18:35:00,424 INFO L158 Benchmark]: TraceAbstraction took 6123.34ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 107.6MB in the beginning and 74.5MB in the end (delta: 33.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-10-12 18:35:00,424 INFO L158 Benchmark]: Witness Printer took 94.43ms. Allocated memory is still 205.5MB. Free memory was 73.5MB in the beginning and 69.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 18:35:00,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.64ms. Allocated memory is still 117.4MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.25ms. Allocated memory is still 169.9MB. Free memory was 134.6MB in the beginning and 122.2MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.88ms. Allocated memory is still 169.9MB. Free memory was 122.2MB in the beginning and 120.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.06ms. Allocated memory is still 169.9MB. Free memory was 120.9MB in the beginning and 119.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 297.86ms. Allocated memory is still 169.9MB. Free memory was 119.6MB in the beginning and 108.4MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6123.34ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 107.6MB in the beginning and 74.5MB in the end (delta: 33.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Witness Printer took 94.43ms. Allocated memory is still 205.5MB. Free memory was 73.5MB in the beginning and 69.3MB 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 - PositiveResult [Line: 13]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 10, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 800 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 589 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 427 IncrementalHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 211 mSDtfsCounter, 427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1073 GetRequests, 978 SyntacticMatches, 7 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=9, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1038 NumberOfCodeBlocks, 933 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 2208 SizeOfPredicates, 4 NumberOfNonLiveVariables, 764 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 10045/10307 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (0 < ((long long) i + 1)) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((i <= 3) && (0 <= i)) && (j == 0)) || ((((j <= 4) && (1 <= j)) && (i <= ((long long) 3 + j))) && (j <= i))) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-10-12 18:35:00,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE