./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/diamond_1-1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/diamond_1-1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 bd9be28702be20fbd75b67eebfdc5f85895ff340c238c235c391c2a8578e7b23 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 21:13:37,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 21:13:37,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 21:13:37,579 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 21:13:37,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 21:13:37,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 21:13:37,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 21:13:37,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 21:13:37,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 21:13:37,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 21:13:37,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 21:13:37,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 21:13:37,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 21:13:37,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 21:13:37,621 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 21:13:37,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 21:13:37,621 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 21:13:37,621 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 21:13:37,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 21:13:37,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 21:13:37,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 21:13:37,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 21:13:37,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 21:13:37,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 21:13:37,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 21:13:37,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 21:13:37,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 21:13:37,627 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 21:13:37,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 21:13:37,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 21:13:37,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 21:13:37,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 21:13:37,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:13:37,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 21:13:37,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 21:13:37,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 21:13:37,630 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 21:13:37,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 21:13:37,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 21:13:37,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 21:13:37,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 21:13:37,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 21:13:37,632 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> bd9be28702be20fbd75b67eebfdc5f85895ff340c238c235c391c2a8578e7b23 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 21:13:37,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 21:13:37,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 21:13:37,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 21:13:37,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 21:13:37,918 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 21:13:37,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2024-09-12 21:13:39,230 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 21:13:39,456 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 21:13:39,456 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2024-09-12 21:13:39,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c51ee96f8/0b06ec54918541ed92006da2c4e65135/FLAGfe5073e58 [2024-09-12 21:13:39,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c51ee96f8/0b06ec54918541ed92006da2c4e65135 [2024-09-12 21:13:39,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 21:13:39,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 21:13:39,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 21:13:39,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 21:13:39,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 21:13:39,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@333eb84e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39, skipping insertion in model container [2024-09-12 21:13:39,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,507 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 21:13:39,649 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/diamond_1-1.c[373,386] [2024-09-12 21:13:39,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:13:39,679 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 21:13:39,687 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/diamond_1-1.c[373,386] [2024-09-12 21:13:39,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 21:13:39,703 INFO L204 MainTranslator]: Completed translation [2024-09-12 21:13:39,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39 WrapperNode [2024-09-12 21:13:39,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 21:13:39,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 21:13:39,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 21:13:39,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 21:13:39,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,721 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 21:13:39,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 21:13:39,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 21:13:39,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 21:13:39,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 21:13:39,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,740 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 21:13:39,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 21:13:39,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 21:13:39,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 21:13:39,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 21:13:39,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (1/1) ... [2024-09-12 21:13:39,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 21:13:39,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:13:39,780 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 21:13:39,784 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 21:13:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 21:13:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 21:13:39,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 21:13:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 21:13:39,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 21:13:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 21:13:39,822 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 21:13:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 21:13:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 21:13:39,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 21:13:39,888 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 21:13:39,890 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 21:13:40,025 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-12 21:13:40,025 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 21:13:40,049 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 21:13:40,050 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 21:13:40,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:13:40 BoogieIcfgContainer [2024-09-12 21:13:40,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 21:13:40,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 21:13:40,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 21:13:40,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 21:13:40,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 09:13:39" (1/3) ... [2024-09-12 21:13:40,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd23bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:13:40, skipping insertion in model container [2024-09-12 21:13:40,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 09:13:39" (2/3) ... [2024-09-12 21:13:40,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd23bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 09:13:40, skipping insertion in model container [2024-09-12 21:13:40,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:13:40" (3/3) ... [2024-09-12 21:13:40,061 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2024-09-12 21:13:40,077 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 21:13:40,077 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 21:13:40,141 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 21:13:40,150 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4a8194aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 21:13:40,150 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 21:13:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 21:13:40,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 21:13:40,160 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:13:40,160 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:13:40,160 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:13:40,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1330752012, now seen corresponding path program 1 times [2024-09-12 21:13:40,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:13:40,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549495169] [2024-09-12 21:13:40,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:40,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:13:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:40,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:13:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:40,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:40,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:13:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549495169] [2024-09-12 21:13:40,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549495169] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:13:40,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:13:40,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 21:13:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436581464] [2024-09-12 21:13:40,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:13:40,329 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 21:13:40,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:13:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 21:13:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 21:13:40,348 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:13:40,365 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-09-12 21:13:40,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 21:13:40,367 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 21:13:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:13:40,371 INFO L225 Difference]: With dead ends: 29 [2024-09-12 21:13:40,371 INFO L226 Difference]: Without dead ends: 12 [2024-09-12 21:13:40,373 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 21:13:40,376 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:13:40,377 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:13:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-12 21:13:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-12 21:13:40,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:40,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-09-12 21:13:40,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-09-12 21:13:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:13:40,406 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-09-12 21:13:40,406 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:40,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-09-12 21:13:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 21:13:40,407 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:13:40,407 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:13:40,407 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 21:13:40,408 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:13:40,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1321516802, now seen corresponding path program 1 times [2024-09-12 21:13:40,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:13:40,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823407573] [2024-09-12 21:13:40,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:40,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:13:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:40,546 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:13:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:13:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823407573] [2024-09-12 21:13:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823407573] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:13:40,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:13:40,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 21:13:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067491271] [2024-09-12 21:13:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:13:40,566 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 21:13:40,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:13:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 21:13:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:13:40,569 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:13:40,592 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-09-12 21:13:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 21:13:40,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 21:13:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:13:40,596 INFO L225 Difference]: With dead ends: 19 [2024-09-12 21:13:40,596 INFO L226 Difference]: Without dead ends: 14 [2024-09-12 21:13:40,597 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:13:40,599 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:13:40,599 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:13:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-12 21:13:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-09-12 21:13:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-09-12 21:13:40,607 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2024-09-12 21:13:40,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:13:40,607 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-09-12 21:13:40,607 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:40,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:40,609 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-09-12 21:13:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 21:13:40,609 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:13:40,610 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:13:40,610 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 21:13:40,610 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:13:40,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:40,611 INFO L85 PathProgramCache]: Analyzing trace with hash -257340833, now seen corresponding path program 1 times [2024-09-12 21:13:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:13:40,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414965589] [2024-09-12 21:13:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:13:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:40,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:13:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:40,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:13:40,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414965589] [2024-09-12 21:13:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414965589] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:13:40,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334543335] [2024-09-12 21:13:40,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:40,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:13:40,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:13:40,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:13:40,804 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 21:13:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:40,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 21:13:40,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:13:40,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:40,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:13:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:40,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334543335] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:13:40,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:13:40,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 21:13:40,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237800596] [2024-09-12 21:13:40,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:13:40,949 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:13:40,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:13:40,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:13:40,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-12 21:13:40,953 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:13:41,040 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2024-09-12 21:13:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 21:13:41,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 21:13:41,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:13:41,044 INFO L225 Difference]: With dead ends: 26 [2024-09-12 21:13:41,044 INFO L226 Difference]: Without dead ends: 21 [2024-09-12 21:13:41,044 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-12 21:13:41,045 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:13:41,046 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 23 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:13:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-12 21:13:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-09-12 21:13:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-09-12 21:13:41,056 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2024-09-12 21:13:41,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:13:41,056 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-09-12 21:13:41,057 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:41,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:41,057 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-09-12 21:13:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 21:13:41,058 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:13:41,058 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:13:41,077 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 21:13:41,258 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:13:41,259 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:13:41,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1209129206, now seen corresponding path program 2 times [2024-09-12 21:13:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:13:41,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194123207] [2024-09-12 21:13:41,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:41,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:13:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:41,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:13:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:41,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:13:41,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194123207] [2024-09-12 21:13:41,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194123207] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:13:41,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333506555] [2024-09-12 21:13:41,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 21:13:41,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:13:41,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:13:41,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:13:41,525 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 21:13:41,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 21:13:41,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:13:41,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 21:13:41,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:13:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:41,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:13:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:41,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333506555] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:13:41,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:13:41,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-12 21:13:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850563626] [2024-09-12 21:13:41,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:13:41,759 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 21:13:41,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:13:41,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 21:13:41,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-09-12 21:13:41,764 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:42,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:13:42,066 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2024-09-12 21:13:42,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 21:13:42,067 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 21:13:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:13:42,069 INFO L225 Difference]: With dead ends: 47 [2024-09-12 21:13:42,069 INFO L226 Difference]: Without dead ends: 42 [2024-09-12 21:13:42,069 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2024-09-12 21:13:42,070 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 21:13:42,071 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 21:13:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-12 21:13:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2024-09-12 21:13:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-09-12 21:13:42,084 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 18 [2024-09-12 21:13:42,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:13:42,084 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-09-12 21:13:42,084 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:42,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-09-12 21:13:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 21:13:42,086 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:13:42,086 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:13:42,102 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 21:13:42,290 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:13:42,291 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:13:42,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:42,292 INFO L85 PathProgramCache]: Analyzing trace with hash -481780085, now seen corresponding path program 1 times [2024-09-12 21:13:42,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:13:42,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793155708] [2024-09-12 21:13:42,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:42,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:13:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:42,339 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:13:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:42,345 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-12 21:13:42,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:13:42,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793155708] [2024-09-12 21:13:42,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793155708] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:13:42,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:13:42,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 21:13:42,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067561761] [2024-09-12 21:13:42,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:13:42,349 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 21:13:42,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:13:42,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 21:13:42,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:13:42,352 INFO L87 Difference]: Start difference. First operand 31 states and 41 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:42,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:13:42,382 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2024-09-12 21:13:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 21:13:42,383 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-09-12 21:13:42,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:13:42,387 INFO L225 Difference]: With dead ends: 61 [2024-09-12 21:13:42,387 INFO L226 Difference]: Without dead ends: 45 [2024-09-12 21:13:42,388 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:13:42,389 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:13:42,391 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:13:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-12 21:13:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-09-12 21:13:42,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-09-12 21:13:42,417 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 24 [2024-09-12 21:13:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:13:42,418 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-09-12 21:13:42,418 INFO L475 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:42,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:42,419 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-09-12 21:13:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 21:13:42,420 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:13:42,420 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:13:42,421 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 21:13:42,421 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:13:42,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:42,421 INFO L85 PathProgramCache]: Analyzing trace with hash 894051711, now seen corresponding path program 1 times [2024-09-12 21:13:42,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:13:42,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712273513] [2024-09-12 21:13:42,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:42,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:13:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:42,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:13:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:42,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:13:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712273513] [2024-09-12 21:13:42,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712273513] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:13:42,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809921019] [2024-09-12 21:13:42,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:42,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:13:42,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:13:42,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:13:42,601 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 21:13:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:42,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 21:13:42,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:13:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:42,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:13:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:42,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809921019] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:13:42,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:13:42,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-09-12 21:13:42,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581876533] [2024-09-12 21:13:42,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:13:42,860 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-12 21:13:42,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:13:42,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-12 21:13:42,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2024-09-12 21:13:42,861 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:13:43,845 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2024-09-12 21:13:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-12 21:13:43,846 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-09-12 21:13:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:13:43,847 INFO L225 Difference]: With dead ends: 124 [2024-09-12 21:13:43,847 INFO L226 Difference]: Without dead ends: 119 [2024-09-12 21:13:43,848 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2024-09-12 21:13:43,849 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 21:13:43,849 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 21:13:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-09-12 21:13:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 62. [2024-09-12 21:13:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2024-09-12 21:13:43,875 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 24 [2024-09-12 21:13:43,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:13:43,876 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-09-12 21:13:43,876 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:43,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2024-09-12 21:13:43,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 21:13:43,877 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:13:43,877 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:13:43,896 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 21:13:44,081 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 21:13:44,082 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:13:44,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash 846282340, now seen corresponding path program 3 times [2024-09-12 21:13:44,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:13:44,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986444503] [2024-09-12 21:13:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:13:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:44,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:13:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:44,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:13:44,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986444503] [2024-09-12 21:13:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986444503] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:13:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390733732] [2024-09-12 21:13:44,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 21:13:44,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:13:44,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:13:44,279 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:13:44,281 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 21:13:44,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-12 21:13:44,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:13:44,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 21:13:44,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:13:44,378 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:44,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:13:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:44,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390733732] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:13:44,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:13:44,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-09-12 21:13:44,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692687437] [2024-09-12 21:13:44,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:13:44,682 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-12 21:13:44,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:13:44,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-12 21:13:44,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2024-09-12 21:13:44,685 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:13:47,725 INFO L93 Difference]: Finished difference Result 206 states and 252 transitions. [2024-09-12 21:13:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 21:13:47,726 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-09-12 21:13:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:13:47,728 INFO L225 Difference]: With dead ends: 206 [2024-09-12 21:13:47,728 INFO L226 Difference]: Without dead ends: 201 [2024-09-12 21:13:47,729 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=440, Invalid=750, Unknown=0, NotChecked=0, Total=1190 [2024-09-12 21:13:47,729 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 21:13:47,730 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 93 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 21:13:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-09-12 21:13:47,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 86. [2024-09-12 21:13:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2024-09-12 21:13:47,765 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 30 [2024-09-12 21:13:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:13:47,769 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2024-09-12 21:13:47,769 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:47,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2024-09-12 21:13:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 21:13:47,771 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:13:47,771 INFO L216 NwaCegarLoop]: trace histogram [15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:13:47,792 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 21:13:47,971 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:13:47,972 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:13:47,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:47,972 INFO L85 PathProgramCache]: Analyzing trace with hash 304315227, now seen corresponding path program 2 times [2024-09-12 21:13:47,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:13:47,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080430928] [2024-09-12 21:13:47,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:47,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:13:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:48,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:13:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-09-12 21:13:48,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:13:48,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080430928] [2024-09-12 21:13:48,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080430928] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:13:48,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 21:13:48,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 21:13:48,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983271309] [2024-09-12 21:13:48,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:13:48,005 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 21:13:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:13:48,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 21:13:48,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:13:48,006 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:13:48,035 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2024-09-12 21:13:48,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 21:13:48,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-09-12 21:13:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:13:48,037 INFO L225 Difference]: With dead ends: 119 [2024-09-12 21:13:48,037 INFO L226 Difference]: Without dead ends: 87 [2024-09-12 21:13:48,038 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 21:13:48,038 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:13:48,039 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:13:48,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-12 21:13:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-09-12 21:13:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.037037037037037) internal successors, (84), 81 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:48,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2024-09-12 21:13:48,065 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 40 [2024-09-12 21:13:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:13:48,066 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2024-09-12 21:13:48,066 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:13:48,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2024-09-12 21:13:48,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-12 21:13:48,067 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:13:48,067 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:13:48,068 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 21:13:48,068 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:13:48,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:13:48,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1116602702, now seen corresponding path program 2 times [2024-09-12 21:13:48,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:13:48,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550493263] [2024-09-12 21:13:48,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:13:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:13:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:48,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:13:48,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:13:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:48,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:13:48,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550493263] [2024-09-12 21:13:48,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550493263] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:13:48,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483001400] [2024-09-12 21:13:48,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 21:13:48,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:13:48,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:13:48,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:13:48,443 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 21:13:48,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 21:13:48,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:13:48,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-12 21:13:48,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:13:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:48,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:13:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:13:49,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483001400] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:13:49,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:13:49,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2024-09-12 21:13:49,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809109325] [2024-09-12 21:13:49,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:13:49,100 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-12 21:13:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:13:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-12 21:13:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2024-09-12 21:13:49,101 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:14:01,405 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2024-09-12 21:14:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-12 21:14:01,405 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2024-09-12 21:14:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:14:01,406 INFO L225 Difference]: With dead ends: 127 [2024-09-12 21:14:01,406 INFO L226 Difference]: Without dead ends: 122 [2024-09-12 21:14:01,407 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=986, Invalid=1770, Unknown=0, NotChecked=0, Total=2756 [2024-09-12 21:14:01,408 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 21:14:01,408 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 21:14:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-12 21:14:01,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-09-12 21:14:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0256410256410255) internal successors, (120), 117 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2024-09-12 21:14:01,441 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 42 [2024-09-12 21:14:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:14:01,442 INFO L474 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2024-09-12 21:14:01,442 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:01,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2024-09-12 21:14:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 21:14:01,444 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:14:01,444 INFO L216 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:14:01,457 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 21:14:01,644 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:01,645 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:14:01,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:01,645 INFO L85 PathProgramCache]: Analyzing trace with hash 212822592, now seen corresponding path program 4 times [2024-09-12 21:14:01,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:14:01,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657115908] [2024-09-12 21:14:01,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:01,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:14:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:02,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:14:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:14:02,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657115908] [2024-09-12 21:14:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657115908] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:14:02,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796415809] [2024-09-12 21:14:02,180 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 21:14:02,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:02,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:14:02,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:14:02,184 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 21:14:02,219 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 21:14:02,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:14:02,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-09-12 21:14:02,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:14:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:02,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 21:14:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-09-12 21:14:03,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796415809] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 21:14:03,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 21:14:03,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27, 6] total 51 [2024-09-12 21:14:03,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994203862] [2024-09-12 21:14:03,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 21:14:03,222 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-09-12 21:14:03,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:14:03,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-09-12 21:14:03,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2320, Unknown=0, NotChecked=0, Total=2550 [2024-09-12 21:14:03,227 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:14:04,125 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2024-09-12 21:14:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-12 21:14:04,125 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2024-09-12 21:14:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:14:04,126 INFO L225 Difference]: With dead ends: 136 [2024-09-12 21:14:04,126 INFO L226 Difference]: Without dead ends: 81 [2024-09-12 21:14:04,127 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=334, Invalid=2636, Unknown=0, NotChecked=0, Total=2970 [2024-09-12 21:14:04,128 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 21:14:04,129 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 97 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 21:14:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-12 21:14:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-09-12 21:14:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:04,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2024-09-12 21:14:04,159 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 54 [2024-09-12 21:14:04,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:14:04,160 INFO L474 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2024-09-12 21:14:04,160 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:04,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2024-09-12 21:14:04,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-09-12 21:14:04,163 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 21:14:04,163 INFO L216 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 21:14:04,180 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 21:14:04,363 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 21:14:04,364 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 21:14:04,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2097515736, now seen corresponding path program 3 times [2024-09-12 21:14:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 21:14:04,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631678882] [2024-09-12 21:14:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 21:14:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 21:14:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:05,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 21:14:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 21:14:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 21:14:05,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 21:14:05,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631678882] [2024-09-12 21:14:05,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631678882] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 21:14:05,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616550650] [2024-09-12 21:14:05,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 21:14:05,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:05,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 21:14:05,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 21:14:05,362 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 21:14:05,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-12 21:14:05,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 21:14:05,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 21:14:05,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 21:14:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2024-09-12 21:14:05,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 21:14:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616550650] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 21:14:05,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 21:14:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [37] total 42 [2024-09-12 21:14:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891236521] [2024-09-12 21:14:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 21:14:05,700 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 21:14:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 21:14:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 21:14:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2024-09-12 21:14:05,701 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:05,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 21:14:05,827 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2024-09-12 21:14:05,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 21:14:05,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2024-09-12 21:14:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 21:14:05,829 INFO L225 Difference]: With dead ends: 79 [2024-09-12 21:14:05,829 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 21:14:05,830 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=1733, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 21:14:05,831 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 21:14:05,831 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 21:14:05,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 21:14:05,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 21:14:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 21:14:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 21:14:05,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2024-09-12 21:14:05,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 21:14:05,833 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 21:14:05,833 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 21:14:05,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 21:14:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 21:14:05,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 21:14:05,836 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 21:14:05,854 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 21:14:06,037 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 21:14:06,041 INFO L408 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1] [2024-09-12 21:14:06,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 21:14:08,495 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 21:14:08,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 09:14:08 BoogieIcfgContainer [2024-09-12 21:14:08,510 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 21:14:08,510 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 21:14:08,510 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 21:14:08,510 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 21:14:08,511 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 09:13:40" (3/4) ... [2024-09-12 21:14:08,513 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 21:14:08,516 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 21:14:08,516 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 21:14:08,516 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 21:14:08,519 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-09-12 21:14:08,519 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 21:14:08,520 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 21:14:08,520 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 21:14:08,602 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 21:14:08,603 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 21:14:08,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 21:14:08,603 INFO L158 Benchmark]: Toolchain (without parser) took 29125.50ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 126.6MB in the beginning and 174.4MB in the end (delta: -47.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-09-12 21:14:08,603 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:14:08,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.07ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 114.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 21:14:08,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.20ms. Allocated memory is still 159.4MB. Free memory was 114.8MB in the beginning and 113.9MB in the end (delta: 856.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 21:14:08,604 INFO L158 Benchmark]: Boogie Preprocessor took 26.45ms. Allocated memory is still 159.4MB. Free memory was 113.9MB in the beginning and 112.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 21:14:08,604 INFO L158 Benchmark]: RCFGBuilder took 302.18ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 100.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 21:14:08,605 INFO L158 Benchmark]: TraceAbstraction took 28457.00ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 100.1MB in the beginning and 178.6MB in the end (delta: -78.5MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2024-09-12 21:14:08,606 INFO L158 Benchmark]: Witness Printer took 92.53ms. Allocated memory is still 213.9MB. Free memory was 178.6MB in the beginning and 174.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 21:14:08,607 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.18ms. Allocated memory is still 159.4MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.07ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 114.8MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.20ms. Allocated memory is still 159.4MB. Free memory was 114.8MB in the beginning and 113.9MB in the end (delta: 856.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.45ms. Allocated memory is still 159.4MB. Free memory was 113.9MB in the beginning and 112.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 302.18ms. Allocated memory is still 159.4MB. Free memory was 112.1MB in the beginning and 100.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28457.00ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 100.1MB in the beginning and 178.6MB in the end (delta: -78.5MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. * Witness Printer took 92.53ms. Allocated memory is still 213.9MB. Free memory was 178.6MB in the beginning and 174.4MB 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: 8]: 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 4 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.9s, OverallIterations: 11, TraceHistogramMax: 34, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 557 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3465 IncrementalHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 112 mSDtfsCounter, 3465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 402 SyntacticMatches, 2 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=9, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 190 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 600 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 756 ConstructedInterpolants, 0 QuantifiedInterpolants, 2541 SizeOfPredicates, 3 NumberOfNonLiveVariables, 523 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 1871/5304 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: 17]: Loop Invariant Derived loop invariant: ((((((x + 4294967295) % 4294967296) <= 98) && (((y / 2) * 2) != y)) || (x == 0)) || (((y % 2) == 0) && ((x % 2) == 0))) - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-12 21:14:08,634 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE