./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/loop-lit/bh2017-ex3.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 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 ../../../trunk/examples/svcomp/loop-lit/bh2017-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 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:36:51,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:36:51,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:36:51,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:36:51,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:36:51,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:36:51,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:36:51,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:36:51,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:36:51,915 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:36:51,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:36:51,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:36:51,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:36:51,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:36:51,917 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:36:51,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:36:51,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:36:51,918 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:36:51,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:36:51,918 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:36:51,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:36:51,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:36:51,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:36:51,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:36:51,919 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:36:51,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:36:51,920 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:36:51,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:36:51,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:36:51,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:36:51,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:36:51,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:36:51,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:36:51,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:36:51,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:36:51,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:36:51,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:36:51,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:36:51,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:36:51,922 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:36:51,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:36:51,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:36:51,923 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 -> 67c3f42f5641e6993fb8445c2fa4fe121d859872ed17b178229098422831f110 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-22 21:36:52,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:36:52,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:36:52,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:36:52,130 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:36:52,130 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:36:52,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/bh2017-ex3.i [2023-11-22 21:36:53,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:36:53,261 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:36:53,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex3.i [2023-11-22 21:36:53,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a78a856/c3f34cac792548259988698c40992ce4/FLAGcd47b7559 [2023-11-22 21:36:53,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72a78a856/c3f34cac792548259988698c40992ce4 [2023-11-22 21:36:53,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:36:53,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:36:53,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:36:53,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:36:53,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:36:53,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,287 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69420ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53, skipping insertion in model container [2023-11-22 21:36:53,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,301 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:36:53,416 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex3.i[799,812] [2023-11-22 21:36:53,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:36:53,438 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:36:53,448 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/bh2017-ex3.i[799,812] [2023-11-22 21:36:53,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:36:53,465 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:36:53,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53 WrapperNode [2023-11-22 21:36:53,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:36:53,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:36:53,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:36:53,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:36:53,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,490 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2023-11-22 21:36:53,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:36:53,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:36:53,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:36:53,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:36:53,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,500 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,506 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 21:36:53,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:36:53,515 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:36:53,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:36:53,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:36:53,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (1/1) ... [2023-11-22 21:36:53,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:36:53,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:36:53,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:36:53,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:36:53,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:36:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 21:36:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:36:53,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:36:53,578 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-22 21:36:53,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-22 21:36:53,645 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:36:53,647 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:36:53,757 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:36:53,771 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:36:53,772 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 21:36:53,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:36:53 BoogieIcfgContainer [2023-11-22 21:36:53,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:36:53,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:36:53,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:36:53,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:36:53,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:36:53" (1/3) ... [2023-11-22 21:36:53,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5499af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:36:53, skipping insertion in model container [2023-11-22 21:36:53,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:36:53" (2/3) ... [2023-11-22 21:36:53,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5499af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:36:53, skipping insertion in model container [2023-11-22 21:36:53,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:36:53" (3/3) ... [2023-11-22 21:36:53,778 INFO L112 eAbstractionObserver]: Analyzing ICFG bh2017-ex3.i [2023-11-22 21:36:53,791 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:36:53,791 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:36:53,822 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:36:53,827 INFO L357 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, mHoare=true, 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;@19c828a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:36:53,827 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:36:53,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:36:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-22 21:36:53,835 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:36:53,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-22 21:36:53,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:36:53,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:36:53,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1248097640, now seen corresponding path program 1 times [2023-11-22 21:36:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:36:53,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163154199] [2023-11-22 21:36:53,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:36:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:36:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:36:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:36:54,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163154199] [2023-11-22 21:36:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163154199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:36:54,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:36:54,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:36:54,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257706495] [2023-11-22 21:36:54,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:36:54,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:36:54,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:36:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:36:54,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:36:54,122 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-22 21:36:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:36:54,186 INFO L93 Difference]: Finished difference Result 45 states and 70 transitions. [2023-11-22 21:36:54,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:36:54,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2023-11-22 21:36:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:36:54,193 INFO L225 Difference]: With dead ends: 45 [2023-11-22 21:36:54,193 INFO L226 Difference]: Without dead ends: 24 [2023-11-22 21:36:54,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:36:54,197 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:36:54,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 68 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:36:54,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-22 21:36:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-22 21:36:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:36:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2023-11-22 21:36:54,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 6 [2023-11-22 21:36:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:36:54,227 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2023-11-22 21:36:54,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-11-22 21:36:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2023-11-22 21:36:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-22 21:36:54,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:36:54,228 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:36:54,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:36:54,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:36:54,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:36:54,229 INFO L85 PathProgramCache]: Analyzing trace with hash 675454336, now seen corresponding path program 1 times [2023-11-22 21:36:54,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:36:54,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134632799] [2023-11-22 21:36:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:36:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:36:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:36:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:36:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:36:54,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134632799] [2023-11-22 21:36:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134632799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:36:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:36:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:36:54,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053865577] [2023-11-22 21:36:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:36:54,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:36:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:36:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:36:54,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:36:54,343 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-11-22 21:36:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:36:54,376 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2023-11-22 21:36:54,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:36:54,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 11 [2023-11-22 21:36:54,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:36:54,377 INFO L225 Difference]: With dead ends: 30 [2023-11-22 21:36:54,377 INFO L226 Difference]: Without dead ends: 28 [2023-11-22 21:36:54,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:36:54,379 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:36:54,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:36:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-22 21:36:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-22 21:36:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-22 21:36:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-22 21:36:54,384 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 11 [2023-11-22 21:36:54,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:36:54,385 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-22 21:36:54,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-11-22 21:36:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-22 21:36:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 21:36:54,386 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:36:54,386 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:36:54,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 21:36:54,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:36:54,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:36:54,387 INFO L85 PathProgramCache]: Analyzing trace with hash 715879520, now seen corresponding path program 1 times [2023-11-22 21:36:54,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:36:54,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684612233] [2023-11-22 21:36:54,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:36:54,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:36:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:36:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:36:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:36:54,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:36:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684612233] [2023-11-22 21:36:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684612233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:36:54,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:36:54,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:36:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905907173] [2023-11-22 21:36:54,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:36:54,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:36:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:36:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:36:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:36:54,431 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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) [2023-11-22 21:36:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:36:54,441 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2023-11-22 21:36:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:36:54,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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 20 [2023-11-22 21:36:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:36:54,442 INFO L225 Difference]: With dead ends: 66 [2023-11-22 21:36:54,443 INFO L226 Difference]: Without dead ends: 39 [2023-11-22 21:36:54,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:36:54,444 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:36:54,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:36:54,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-22 21:36:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-22 21:36:54,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-22 21:36:54,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2023-11-22 21:36:54,456 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 20 [2023-11-22 21:36:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:36:54,457 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2023-11-22 21:36:54,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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) [2023-11-22 21:36:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2023-11-22 21:36:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-22 21:36:54,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:36:54,459 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:36:54,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 21:36:54,460 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:36:54,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:36:54,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1791028434, now seen corresponding path program 1 times [2023-11-22 21:36:54,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:36:54,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115864579] [2023-11-22 21:36:54,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:36:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:36:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:36:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:36:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:36:54,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:36:54,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115864579] [2023-11-22 21:36:54,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115864579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:36:54,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:36:54,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-22 21:36:54,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999135144] [2023-11-22 21:36:54,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:36:54,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-22 21:36:54,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:36:54,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-22 21:36:54,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:36:54,502 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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) [2023-11-22 21:36:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:36:54,514 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2023-11-22 21:36:54,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-22 21:36:54,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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 20 [2023-11-22 21:36:54,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:36:54,516 INFO L225 Difference]: With dead ends: 97 [2023-11-22 21:36:54,516 INFO L226 Difference]: Without dead ends: 59 [2023-11-22 21:36:54,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-22 21:36:54,517 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:36:54,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:36:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-22 21:36:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-22 21:36:54,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-22 21:36:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2023-11-22 21:36:54,527 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 20 [2023-11-22 21:36:54,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:36:54,528 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2023-11-22 21:36:54,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 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) [2023-11-22 21:36:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2023-11-22 21:36:54,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 21:36:54,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:36:54,529 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-22 21:36:54,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 21:36:54,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:36:54,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:36:54,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1325115391, now seen corresponding path program 1 times [2023-11-22 21:36:54,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:36:54,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051593757] [2023-11-22 21:36:54,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:36:54,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:36:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:36:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:36:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:36:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:36:54,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 21:36:54,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:36:54,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051593757] [2023-11-22 21:36:54,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051593757] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:36:54,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257052386] [2023-11-22 21:36:54,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:36:54,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:36:54,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:36:54,605 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) [2023-11-22 21:36:54,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 21:36:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:54,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:36:54,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:36:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 21:36:54,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:36:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 21:36:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257052386] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:36:54,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:36:54,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-22 21:36:54,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128752231] [2023-11-22 21:36:54,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:36:54,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:36:54,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:36:54,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:36:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:36:54,738 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-22 21:36:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:36:54,778 INFO L93 Difference]: Finished difference Result 177 states and 269 transitions. [2023-11-22 21:36:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:36:54,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 35 [2023-11-22 21:36:54,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:36:54,783 INFO L225 Difference]: With dead ends: 177 [2023-11-22 21:36:54,784 INFO L226 Difference]: Without dead ends: 119 [2023-11-22 21:36:54,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:36:54,786 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 56 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:36:54,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 94 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:36:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-22 21:36:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-22 21:36:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-22 21:36:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2023-11-22 21:36:54,800 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 35 [2023-11-22 21:36:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:36:54,800 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2023-11-22 21:36:54,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-22 21:36:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2023-11-22 21:36:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-22 21:36:54,801 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:36:54,802 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-22 21:36:54,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 21:36:55,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:36:55,012 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:36:55,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:36:55,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1704439485, now seen corresponding path program 1 times [2023-11-22 21:36:55,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:36:55,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663399677] [2023-11-22 21:36:55,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:36:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:36:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:36:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:36:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:36:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:36:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,098 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 21:36:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:36:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663399677] [2023-11-22 21:36:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663399677] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-22 21:36:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150768696] [2023-11-22 21:36:55,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:36:55,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:36:55,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:36:55,100 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) [2023-11-22 21:36:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-22 21:36:55,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:36:55,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 21:36:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 21:36:55,169 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:36:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-22 21:36:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150768696] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-22 21:36:55,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-22 21:36:55,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-22 21:36:55,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48311059] [2023-11-22 21:36:55,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-22 21:36:55,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-22 21:36:55,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:36:55,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-22 21:36:55,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:36:55,214 INFO L87 Difference]: Start difference. First operand 119 states and 180 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-22 21:36:55,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:36:55,262 INFO L93 Difference]: Finished difference Result 378 states and 596 transitions. [2023-11-22 21:36:55,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:36:55,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 35 [2023-11-22 21:36:55,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:36:55,265 INFO L225 Difference]: With dead ends: 378 [2023-11-22 21:36:55,265 INFO L226 Difference]: Without dead ends: 260 [2023-11-22 21:36:55,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:36:55,273 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:36:55,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 104 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:36:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-22 21:36:55,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2023-11-22 21:36:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 196 states have (on average 1.4387755102040816) internal successors, (282), 196 states have internal predecessors, (282), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-22 21:36:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 402 transitions. [2023-11-22 21:36:55,304 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 402 transitions. Word has length 35 [2023-11-22 21:36:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:36:55,304 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 402 transitions. [2023-11-22 21:36:55,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 6 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-22 21:36:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 402 transitions. [2023-11-22 21:36:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-22 21:36:55,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:36:55,308 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2023-11-22 21:36:55,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-22 21:36:55,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-22 21:36:55,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:36:55,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:36:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash -563554144, now seen corresponding path program 2 times [2023-11-22 21:36:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:36:55,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318168479] [2023-11-22 21:36:55,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:36:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:36:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:36:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:36:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:36:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:36:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 21:36:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 21:36:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:36:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:36:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:36:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:36:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-11-22 21:36:55,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:36:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318168479] [2023-11-22 21:36:55,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318168479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:36:55,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:36:55,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:36:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366570634] [2023-11-22 21:36:55,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:36:55,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:36:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:36:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:36:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:36:55,690 INFO L87 Difference]: Start difference. First operand 260 states and 402 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 21:36:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:36:55,747 INFO L93 Difference]: Finished difference Result 266 states and 407 transitions. [2023-11-22 21:36:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:36:55,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 80 [2023-11-22 21:36:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:36:55,750 INFO L225 Difference]: With dead ends: 266 [2023-11-22 21:36:55,751 INFO L226 Difference]: Without dead ends: 264 [2023-11-22 21:36:55,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:36:55,752 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:36:55,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 83 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:36:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-22 21:36:55,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2023-11-22 21:36:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 199 states have (on average 1.4321608040201006) internal successors, (285), 199 states have internal predecessors, (285), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-11-22 21:36:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 405 transitions. [2023-11-22 21:36:55,788 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 405 transitions. Word has length 80 [2023-11-22 21:36:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:36:55,788 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 405 transitions. [2023-11-22 21:36:55,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 21:36:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 405 transitions. [2023-11-22 21:36:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-22 21:36:55,795 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:36:55,795 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2023-11-22 21:36:55,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-22 21:36:55,797 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:36:55,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:36:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1289698158, now seen corresponding path program 2 times [2023-11-22 21:36:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:36:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314368702] [2023-11-22 21:36:55,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:36:55,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:36:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 21:36:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 21:36:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-22 21:36:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-22 21:36:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-22 21:36:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-22 21:36:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-22 21:36:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-22 21:36:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 21:36:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-22 21:36:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:36:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-11-22 21:36:55,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:36:55,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314368702] [2023-11-22 21:36:55,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314368702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:36:55,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:36:55,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-22 21:36:55,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708174319] [2023-11-22 21:36:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:36:55,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-22 21:36:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:36:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-22 21:36:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-22 21:36:55,927 INFO L87 Difference]: Start difference. First operand 264 states and 405 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 21:36:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:36:55,971 INFO L93 Difference]: Finished difference Result 264 states and 405 transitions. [2023-11-22 21:36:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-22 21:36:55,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 80 [2023-11-22 21:36:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:36:55,973 INFO L225 Difference]: With dead ends: 264 [2023-11-22 21:36:55,974 INFO L226 Difference]: Without dead ends: 0 [2023-11-22 21:36:55,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:36:55,975 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:36:55,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 83 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:36:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-22 21:36:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-22 21:36:55,977 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) [2023-11-22 21:36:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-22 21:36:55,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2023-11-22 21:36:55,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:36:55,977 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-22 21:36:55,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-11-22 21:36:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-22 21:36:55,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-22 21:36:55,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-22 21:36:55,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-22 21:36:55,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-22 21:36:56,310 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (= |ULTIMATE.start_main_~m~0#1| 60) (<= |ULTIMATE.start_main_~n~0#1| 60)) [2023-11-22 21:36:56,310 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-11-22 21:36:56,311 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 29) no Hoare annotation was computed. [2023-11-22 21:36:56,311 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~m~0#1| 60) (<= |ULTIMATE.start_main_~n~0#1| 60)) [2023-11-22 21:36:56,311 INFO L895 garLoopResultBuilder]: At program point L19-1(line 19) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~m~0#1| 60) (<= |ULTIMATE.start_main_~n~0#1| 60)) [2023-11-22 21:36:56,311 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-22 21:36:56,311 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 41) no Hoare annotation was computed. [2023-11-22 21:36:56,311 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-22 21:36:56,311 INFO L895 garLoopResultBuilder]: At program point L33-1(lines 18 43) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~m~0#1| 60) (<= |ULTIMATE.start_main_~n~0#1| 60)) [2023-11-22 21:36:56,311 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 42) no Hoare annotation was computed. [2023-11-22 21:36:56,312 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-22 21:36:56,312 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~m~0#1| 60) (= |ULTIMATE.start_main_~n~0#1| 60)) [2023-11-22 21:36:56,312 INFO L899 garLoopResultBuilder]: For program point L38-1(line 38) no Hoare annotation was computed. [2023-11-22 21:36:56,312 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 40) no Hoare annotation was computed. [2023-11-22 21:36:56,312 INFO L899 garLoopResultBuilder]: For program point L22(lines 22 30) no Hoare annotation was computed. [2023-11-22 21:36:56,312 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 18 43) no Hoare annotation was computed. [2023-11-22 21:36:56,312 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2023-11-22 21:36:56,312 INFO L899 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2023-11-22 21:36:56,313 INFO L899 garLoopResultBuilder]: For program point L13-3(line 13) no Hoare annotation was computed. [2023-11-22 21:36:56,313 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2023-11-22 21:36:56,313 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 13) the Hoare annotation is: true [2023-11-22 21:36:56,313 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2023-11-22 21:36:56,315 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-11-22 21:36:56,317 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-22 21:36:56,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:36:56 BoogieIcfgContainer [2023-11-22 21:36:56,337 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-22 21:36:56,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-22 21:36:56,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-22 21:36:56,338 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-22 21:36:56,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:36:53" (3/4) ... [2023-11-22 21:36:56,339 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-22 21:36:56,342 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-22 21:36:56,344 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2023-11-22 21:36:56,345 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-22 21:36:56,345 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-22 21:36:56,345 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-22 21:36:56,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-22 21:36:56,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-22 21:36:56,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-22 21:36:56,403 INFO L158 Benchmark]: Toolchain (without parser) took 3122.01ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 105.2MB in the beginning and 84.5MB in the end (delta: 20.7MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2023-11-22 21:36:56,403 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:36:56,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.45ms. Allocated memory is still 159.4MB. Free memory was 104.9MB in the beginning and 94.1MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-22 21:36:56,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.52ms. Allocated memory is still 159.4MB. Free memory was 94.1MB in the beginning and 92.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-22 21:36:56,404 INFO L158 Benchmark]: Boogie Preprocessor took 23.11ms. Allocated memory is still 159.4MB. Free memory was 92.6MB in the beginning and 91.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-22 21:36:56,404 INFO L158 Benchmark]: RCFGBuilder took 257.64ms. Allocated memory is still 159.4MB. Free memory was 91.1MB in the beginning and 125.6MB in the end (delta: -34.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2023-11-22 21:36:56,404 INFO L158 Benchmark]: TraceAbstraction took 2563.54ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 124.8MB in the beginning and 88.7MB in the end (delta: 36.1MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2023-11-22 21:36:56,404 INFO L158 Benchmark]: Witness Printer took 64.95ms. Allocated memory is still 192.9MB. Free memory was 88.7MB in the beginning and 84.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-22 21:36:56,405 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.45ms. Allocated memory is still 159.4MB. Free memory was 104.9MB in the beginning and 94.1MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.52ms. Allocated memory is still 159.4MB. Free memory was 94.1MB in the beginning and 92.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.11ms. Allocated memory is still 159.4MB. Free memory was 92.6MB in the beginning and 91.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 257.64ms. Allocated memory is still 159.4MB. Free memory was 91.1MB in the beginning and 125.6MB in the end (delta: -34.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2563.54ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 124.8MB in the beginning and 88.7MB in the end (delta: 36.1MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. * Witness Printer took 64.95ms. Allocated memory is still 192.9MB. Free memory was 88.7MB in the beginning and 84.5MB 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 168 mSDsluCounter, 606 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 412 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 194 mSDtfsCounter, 156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=264occurred in iteration=7, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 119 PreInvPairs, 204 NumberOfFragments, 36 HoareAnnotationTreeSize, 119 FomulaSimplifications, 894 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 565 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 415 ConstructedInterpolants, 0 QuantifiedInterpolants, 677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 158 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 750/792 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: 18]: Loop Invariant Derived loop invariant: ((m <= 60) && (n <= 60)) RESULT: Ultimate proved your program to be correct! [2023-11-22 21:36:56,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE