./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c --full-output --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 a9b967e5 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/nla-digbench-scaling/hard-ll_valuebound2.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 9851f41ad4fb2d0ff96507e8e48f0d2886a8de6481eed845b23377b9fa492b45 --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-a9b967e-m [2024-09-11 20:07:35,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:07:35,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:07:35,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:07:35,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:07:35,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:07:35,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:07:35,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:07:35,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:07:35,287 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:07:35,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:07:35,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:07:35,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:07:35,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:07:35,290 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:07:35,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:07:35,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:07:35,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:07:35,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:07:35,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:07:35,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:07:35,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:07:35,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:07:35,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:07:35,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:07:35,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:07:35,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:07:35,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:07:35,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:07:35,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:07:35,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:07:35,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:07:35,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:07:35,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:07:35,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:07:35,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:07:35,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:07:35,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:07:35,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:07:35,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:07:35,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:07:35,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:07:35,302 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 -> 9851f41ad4fb2d0ff96507e8e48f0d2886a8de6481eed845b23377b9fa492b45 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-11 20:07:35,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:07:35,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:07:35,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:07:35,557 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:07:35,558 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:07:35,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-11 20:07:36,968 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:07:37,145 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:07:37,147 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-11 20:07:37,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4667ab0b5/06a31265e0bc4ff1beee60e29ae44634/FLAG5736fc0a1 [2024-09-11 20:07:37,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4667ab0b5/06a31265e0bc4ff1beee60e29ae44634 [2024-09-11 20:07:37,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:07:37,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:07:37,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:07:37,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:07:37,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:07:37,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550c12a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37, skipping insertion in model container [2024-09-11 20:07:37,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:07:37,326 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/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2024-09-11 20:07:37,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:07:37,356 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:07:37,384 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/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2024-09-11 20:07:37,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:07:37,420 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:07:37,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37 WrapperNode [2024-09-11 20:07:37,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:07:37,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:07:37,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:07:37,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:07:37,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,467 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-11 20:07:37,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:07:37,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:07:37,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:07:37,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:07:37,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,485 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,501 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-11 20:07:37,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:07:37,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:07:37,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:07:37,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:07:37,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (1/1) ... [2024-09-11 20:07:37,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:07:37,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:37,563 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-11 20:07:37,566 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-11 20:07:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:07:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 20:07:37,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 20:07:37,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:07:37,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:07:37,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:07:37,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:07:37,612 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:07:37,674 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:07:37,676 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:07:37,800 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 20:07:37,801 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:07:37,827 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:07:37,828 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 20:07:37,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:07:37 BoogieIcfgContainer [2024-09-11 20:07:37,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:07:37,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:07:37,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:07:37,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:07:37,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:07:37" (1/3) ... [2024-09-11 20:07:37,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c11e1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:07:37, skipping insertion in model container [2024-09-11 20:07:37,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:07:37" (2/3) ... [2024-09-11 20:07:37,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c11e1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:07:37, skipping insertion in model container [2024-09-11 20:07:37,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:07:37" (3/3) ... [2024-09-11 20:07:37,839 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound2.c [2024-09-11 20:07:37,854 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:07:37,854 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:07:37,901 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:07:37,907 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;@56b2d37e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:07:37,908 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:07:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 20:07:37,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:07:37,916 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:37,917 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:37,918 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:37,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2024-09-11 20:07:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:37,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659212358] [2024-09-11 20:07:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:07:38,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:38,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659212358] [2024-09-11 20:07:38,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659212358] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:38,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:07:38,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:07:38,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842968428] [2024-09-11 20:07:38,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:38,154 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:07:38,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:38,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:07:38,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:07:38,191 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:07:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:38,219 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2024-09-11 20:07:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:07:38,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-11 20:07:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:38,229 INFO L225 Difference]: With dead ends: 58 [2024-09-11 20:07:38,229 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 20:07:38,232 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-11 20:07:38,235 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:38,236 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:07:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 20:07:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 20:07:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:07:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-09-11 20:07:38,270 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2024-09-11 20:07:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:38,271 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-09-11 20:07:38,271 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:07:38,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-09-11 20:07:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:07:38,273 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:38,274 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:38,274 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:07:38,274 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:38,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2024-09-11 20:07:38,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:38,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527397656] [2024-09-11 20:07:38,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,556 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:07:38,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:38,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527397656] [2024-09-11 20:07:38,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527397656] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:38,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:07:38,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:07:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076520884] [2024-09-11 20:07:38,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:38,568 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:38,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:38,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:38,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:07:38,572 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:07:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:38,657 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-09-11 20:07:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:38,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-11 20:07:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:38,660 INFO L225 Difference]: With dead ends: 41 [2024-09-11 20:07:38,661 INFO L226 Difference]: Without dead ends: 39 [2024-09-11 20:07:38,662 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:07:38,664 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:38,664 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:07:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-11 20:07:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-09-11 20:07:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:07:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-11 20:07:38,683 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2024-09-11 20:07:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:38,683 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-11 20:07:38,684 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:07:38,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:38,685 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-11 20:07:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:07:38,686 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:38,687 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:38,687 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:07:38,687 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:38,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:38,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2024-09-11 20:07:38,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:38,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190583438] [2024-09-11 20:07:38,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:38,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:07:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:07:38,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:38,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190583438] [2024-09-11 20:07:38,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190583438] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:38,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:07:38,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:07:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229435779] [2024-09-11 20:07:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:38,891 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:07:38,892 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:07:38,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:38,972 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-09-11 20:07:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:38,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-11 20:07:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:38,975 INFO L225 Difference]: With dead ends: 45 [2024-09-11 20:07:38,976 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 20:07:38,977 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:07:38,978 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:38,980 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:07:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 20:07:38,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-11 20:07:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:07:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-09-11 20:07:38,993 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2024-09-11 20:07:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:38,994 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-09-11 20:07:38,994 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:07:38,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-09-11 20:07:38,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-11 20:07:38,995 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:38,996 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:38,996 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:07:38,996 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:38,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:38,997 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2024-09-11 20:07:38,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:38,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660981583] [2024-09-11 20:07:38,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:38,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:39,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100330326] [2024-09-11 20:07:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:39,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:39,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:39,022 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-11 20:07:39,024 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-11 20:07:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:39,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:07:39,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:07:39,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:07:39,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:39,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660981583] [2024-09-11 20:07:39,201 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:07:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100330326] [2024-09-11 20:07:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100330326] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:39,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:07:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:07:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395654815] [2024-09-11 20:07:39,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:39,206 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:39,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:39,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:07:39,207 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:07:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:39,295 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-09-11 20:07:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:39,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-11 20:07:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:39,297 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:07:39,297 INFO L226 Difference]: Without dead ends: 49 [2024-09-11 20:07:39,297 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:07:39,298 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:39,298 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 117 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:07:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-11 20:07:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-11 20:07:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:07:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-09-11 20:07:39,322 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 33 [2024-09-11 20:07:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:39,323 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-09-11 20:07:39,323 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:07:39,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-09-11 20:07:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 20:07:39,324 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:39,324 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:39,342 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:07:39,526 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:39,526 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:39,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2024-09-11 20:07:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:39,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974113184] [2024-09-11 20:07:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:39,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [207096108] [2024-09-11 20:07:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:39,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:39,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:39,544 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-11 20:07:39,548 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-11 20:07:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:39,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-11 20:07:39,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-11 20:07:39,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-11 20:07:39,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:39,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974113184] [2024-09-11 20:07:39,919 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:07:39,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207096108] [2024-09-11 20:07:39,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207096108] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:07:39,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:07:39,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-11 20:07:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837559991] [2024-09-11 20:07:39,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:07:39,922 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:07:39,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:39,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:07:39,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:07:39,923 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 20:07:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:40,071 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-09-11 20:07:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:07:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 40 [2024-09-11 20:07:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:40,075 INFO L225 Difference]: With dead ends: 64 [2024-09-11 20:07:40,075 INFO L226 Difference]: Without dead ends: 62 [2024-09-11 20:07:40,075 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:07:40,076 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:40,076 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:07:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-11 20:07:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-09-11 20:07:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-11 20:07:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2024-09-11 20:07:40,094 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 40 [2024-09-11 20:07:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:40,095 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2024-09-11 20:07:40,095 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 20:07:40,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:40,095 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-09-11 20:07:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:07:40,097 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:40,097 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:40,111 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:07:40,301 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:40,302 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:40,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1147651331, now seen corresponding path program 1 times [2024-09-11 20:07:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:40,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152459876] [2024-09-11 20:07:40,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:40,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:40,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204256358] [2024-09-11 20:07:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:40,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:40,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:40,323 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-11 20:07:40,325 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-11 20:07:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:40,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 20:07:40,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-11 20:07:40,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-11 20:07:40,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152459876] [2024-09-11 20:07:40,610 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:07:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204256358] [2024-09-11 20:07:40,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204256358] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:07:40,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:07:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-11 20:07:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307877777] [2024-09-11 20:07:40,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:40,611 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:40,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:40,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:07:40,612 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 20:07:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:40,700 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-09-11 20:07:40,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:40,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2024-09-11 20:07:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:40,702 INFO L225 Difference]: With dead ends: 69 [2024-09-11 20:07:40,703 INFO L226 Difference]: Without dead ends: 67 [2024-09-11 20:07:40,703 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:07:40,704 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:40,704 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 110 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:07:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-11 20:07:40,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-09-11 20:07:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-11 20:07:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-09-11 20:07:40,724 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 50 [2024-09-11 20:07:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:40,725 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-09-11 20:07:40,725 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-11 20:07:40,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-09-11 20:07:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-11 20:07:40,728 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:40,728 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:40,745 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:07:40,932 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-11 20:07:40,933 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:40,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash 73871321, now seen corresponding path program 1 times [2024-09-11 20:07:40,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:40,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488186043] [2024-09-11 20:07:40,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:40,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:07:41,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:07:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:07:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:07:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:07:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-11 20:07:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-11 20:07:41,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488186043] [2024-09-11 20:07:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488186043] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:41,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:07:41,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:07:41,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427897792] [2024-09-11 20:07:41,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:41,132 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:41,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:41,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:41,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:07:41,133 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-11 20:07:41,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:41,248 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2024-09-11 20:07:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:41,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 56 [2024-09-11 20:07:41,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:41,251 INFO L225 Difference]: With dead ends: 74 [2024-09-11 20:07:41,251 INFO L226 Difference]: Without dead ends: 62 [2024-09-11 20:07:41,252 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:07:41,253 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:41,253 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 127 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:07:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-11 20:07:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-09-11 20:07:41,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (17), 15 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-11 20:07:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2024-09-11 20:07:41,278 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 56 [2024-09-11 20:07:41,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:41,278 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2024-09-11 20:07:41,278 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-09-11 20:07:41,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2024-09-11 20:07:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-11 20:07:41,279 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:41,280 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:41,280 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 20:07:41,280 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:41,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2024-09-11 20:07:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:41,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463312843] [2024-09-11 20:07:41,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:41,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:41,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1261082084] [2024-09-11 20:07:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:41,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:41,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:41,329 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-11 20:07:41,331 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-11 20:07:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:41,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-11 20:07:41,395 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-09-11 20:07:42,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-11 20:07:43,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:43,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463312843] [2024-09-11 20:07:43,997 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:07:43,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261082084] [2024-09-11 20:07:43,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261082084] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:07:43,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:07:43,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-11 20:07:43,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257456220] [2024-09-11 20:07:43,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:07:43,998 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:07:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:44,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:07:44,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:07:44,000 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 10 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2024-09-11 20:07:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:45,385 INFO L93 Difference]: Finished difference Result 148 states and 204 transitions. [2024-09-11 20:07:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-11 20:07:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 10 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 70 [2024-09-11 20:07:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:45,388 INFO L225 Difference]: With dead ends: 148 [2024-09-11 20:07:45,388 INFO L226 Difference]: Without dead ends: 125 [2024-09-11 20:07:45,389 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:07:45,389 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 100 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:45,389 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 269 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-11 20:07:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-09-11 20:07:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2024-09-11 20:07:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 64 states have internal predecessors, (71), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2024-09-11 20:07:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2024-09-11 20:07:45,439 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 70 [2024-09-11 20:07:45,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:45,439 INFO L474 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2024-09-11 20:07:45,440 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 10 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2024-09-11 20:07:45,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:45,440 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2024-09-11 20:07:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-11 20:07:45,441 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:45,442 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:45,462 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:07:45,642 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:45,642 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:45,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:45,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1411586487, now seen corresponding path program 1 times [2024-09-11 20:07:45,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:45,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312507774] [2024-09-11 20:07:45,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:45,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:45,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194164864] [2024-09-11 20:07:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:45,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:45,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:45,677 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-11 20:07:45,678 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-11 20:07:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:45,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-11 20:07:45,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-09-11 20:07:46,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:46,878 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-11 20:07:46,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:46,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312507774] [2024-09-11 20:07:46,879 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:07:46,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194164864] [2024-09-11 20:07:46,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194164864] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:07:46,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:07:46,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-11 20:07:46,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832013359] [2024-09-11 20:07:46,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:07:46,881 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 20:07:46,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:46,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 20:07:46,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:07:46,882 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 11 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 9 states have call successors, (24) [2024-09-11 20:07:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:47,394 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2024-09-11 20:07:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:07:47,395 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 11 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 9 states have call successors, (24) Word has length 81 [2024-09-11 20:07:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:47,396 INFO L225 Difference]: With dead ends: 141 [2024-09-11 20:07:47,396 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 20:07:47,397 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:07:47,397 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 25 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:47,398 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 323 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:07:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 20:07:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2024-09-11 20:07:47,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-11 20:07:47,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2024-09-11 20:07:47,431 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 81 [2024-09-11 20:07:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:47,432 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2024-09-11 20:07:47,432 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 17 states have internal predecessors, (36), 11 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (24), 10 states have call predecessors, (24), 9 states have call successors, (24) [2024-09-11 20:07:47,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2024-09-11 20:07:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-09-11 20:07:47,434 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:47,434 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:47,450 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-11 20:07:47,637 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-11 20:07:47,638 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:47,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash -302279341, now seen corresponding path program 2 times [2024-09-11 20:07:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:47,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457321627] [2024-09-11 20:07:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:47,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:07:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:07:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:07:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:07:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:07:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:07:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,869 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:07:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:07:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-11 20:07:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-11 20:07:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-11 20:07:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:47,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457321627] [2024-09-11 20:07:47,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457321627] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:07:47,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186564165] [2024-09-11 20:07:47,886 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:07:47,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:47,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:47,889 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-11 20:07:47,891 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-11 20:07:47,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:07:47,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:07:47,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:07:47,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-11 20:07:47,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-11 20:07:48,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186564165] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:07:48,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:07:48,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-09-11 20:07:48,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055633071] [2024-09-11 20:07:48,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:07:48,082 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:48,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:48,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:48,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:07:48,082 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-09-11 20:07:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:48,160 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2024-09-11 20:07:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 20:07:48,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 83 [2024-09-11 20:07:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:48,162 INFO L225 Difference]: With dead ends: 120 [2024-09-11 20:07:48,162 INFO L226 Difference]: Without dead ends: 98 [2024-09-11 20:07:48,162 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:07:48,163 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:48,163 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:07:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-11 20:07:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-09-11 20:07:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.152542372881356) internal successors, (68), 61 states have internal predecessors, (68), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-09-11 20:07:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2024-09-11 20:07:48,209 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 83 [2024-09-11 20:07:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:48,211 INFO L474 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2024-09-11 20:07:48,211 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2024-09-11 20:07:48,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2024-09-11 20:07:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-09-11 20:07:48,214 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:48,214 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:48,230 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 20:07:48,414 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-11 20:07:48,415 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:48,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1047816948, now seen corresponding path program 1 times [2024-09-11 20:07:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:48,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315620246] [2024-09-11 20:07:48,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:48,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,627 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,634 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:07:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:07:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,641 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:07:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:07:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:07:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:07:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:07:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:07:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-11 20:07:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-11 20:07:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-11 20:07:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,684 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-11 20:07:48,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:48,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315620246] [2024-09-11 20:07:48,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315620246] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:07:48,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9353453] [2024-09-11 20:07:48,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:48,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:48,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:48,687 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-11 20:07:48,688 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-11 20:07:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:48,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-11 20:07:48,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-09-11 20:07:49,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-11 20:07:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9353453] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:07:49,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:07:49,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 18 [2024-09-11 20:07:49,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186355563] [2024-09-11 20:07:49,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:07:49,446 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 20:07:49,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 20:07:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-11 20:07:49,447 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 10 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) [2024-09-11 20:07:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:49,754 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2024-09-11 20:07:49,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:07:49,754 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 10 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) Word has length 86 [2024-09-11 20:07:49,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:49,756 INFO L225 Difference]: With dead ends: 113 [2024-09-11 20:07:49,756 INFO L226 Difference]: Without dead ends: 96 [2024-09-11 20:07:49,756 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:07:49,757 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 22 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:49,757 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 351 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:07:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-11 20:07:49,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2024-09-11 20:07:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 56 states have internal predecessors, (62), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-11 20:07:49,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2024-09-11 20:07:49,787 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 86 [2024-09-11 20:07:49,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:49,787 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2024-09-11 20:07:49,787 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 10 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 11 states have call predecessors, (32), 10 states have call successors, (32) [2024-09-11 20:07:49,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2024-09-11 20:07:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-11 20:07:49,789 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:49,789 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:49,804 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-11 20:07:49,992 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-11 20:07:49,993 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:49,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:49,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1271237959, now seen corresponding path program 1 times [2024-09-11 20:07:49,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:49,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580538968] [2024-09-11 20:07:49,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:49,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,062 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,063 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:07:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:07:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:07:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:07:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:07:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:07:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:07:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:07:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 20:07:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,084 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 20:07:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,087 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 20:07:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-11 20:07:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-11 20:07:50,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580538968] [2024-09-11 20:07:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580538968] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:07:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582641988] [2024-09-11 20:07:50,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:50,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:50,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:50,094 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:07:50,096 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-11 20:07:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 20:07:50,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:50,187 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-11 20:07:50,187 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:07:50,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582641988] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:07:50,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:07:50,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-09-11 20:07:50,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646993555] [2024-09-11 20:07:50,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:07:50,189 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:07:50,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:07:50,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:07:50,189 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-11 20:07:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:50,257 INFO L93 Difference]: Finished difference Result 96 states and 113 transitions. [2024-09-11 20:07:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:07:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 90 [2024-09-11 20:07:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:50,259 INFO L225 Difference]: With dead ends: 96 [2024-09-11 20:07:50,259 INFO L226 Difference]: Without dead ends: 84 [2024-09-11 20:07:50,260 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:07:50,260 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:50,260 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:07:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-11 20:07:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-09-11 20:07:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 22 states have call successors, (22), 10 states have call predecessors, (22), 10 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-11 20:07:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2024-09-11 20:07:50,286 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 90 [2024-09-11 20:07:50,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:50,286 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2024-09-11 20:07:50,286 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-11 20:07:50,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2024-09-11 20:07:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-09-11 20:07:50,287 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:50,288 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:50,304 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-11 20:07:50,488 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:50,488 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:50,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1209712204, now seen corresponding path program 3 times [2024-09-11 20:07:50,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:50,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72966925] [2024-09-11 20:07:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:50,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:07:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:07:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,970 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:07:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:07:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:07:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:50,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:07:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:07:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:07:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:07:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,013 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:07:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:07:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,023 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 20:07:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 20:07:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 20:07:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-11 20:07:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-11 20:07:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 45 proven. 11 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-11 20:07:51,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:51,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72966925] [2024-09-11 20:07:51,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72966925] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:07:51,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603600536] [2024-09-11 20:07:51,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:07:51,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:51,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:51,053 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:07:51,054 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-11 20:07:51,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-11 20:07:51,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:07:51,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-11 20:07:51,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-11 20:07:51,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:52,778 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-11 20:07:52,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603600536] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:07:52,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:07:52,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-09-11 20:07:52,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244442372] [2024-09-11 20:07:52,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:07:52,780 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 20:07:52,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:52,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 20:07:52,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:07:52,782 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 16 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (44), 16 states have call predecessors, (44), 15 states have call successors, (44) [2024-09-11 20:07:53,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:53,607 INFO L93 Difference]: Finished difference Result 209 states and 289 transitions. [2024-09-11 20:07:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-11 20:07:53,607 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 16 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (44), 16 states have call predecessors, (44), 15 states have call successors, (44) Word has length 100 [2024-09-11 20:07:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:53,609 INFO L225 Difference]: With dead ends: 209 [2024-09-11 20:07:53,609 INFO L226 Difference]: Without dead ends: 157 [2024-09-11 20:07:53,610 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2024-09-11 20:07:53,610 INFO L434 NwaCegarLoop]: 59 mSDtfsCounter, 73 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:53,611 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 623 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:07:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-09-11 20:07:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2024-09-11 20:07:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.208955223880597) internal successors, (81), 68 states have internal predecessors, (81), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-09-11 20:07:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 144 transitions. [2024-09-11 20:07:53,663 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 144 transitions. Word has length 100 [2024-09-11 20:07:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:53,664 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 144 transitions. [2024-09-11 20:07:53,664 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 16 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (44), 16 states have call predecessors, (44), 15 states have call successors, (44) [2024-09-11 20:07:53,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 144 transitions. [2024-09-11 20:07:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-09-11 20:07:53,665 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:53,665 INFO L216 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:53,682 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-11 20:07:53,866 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-11 20:07:53,866 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:53,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1299465319, now seen corresponding path program 1 times [2024-09-11 20:07:53,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:53,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658617688] [2024-09-11 20:07:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:53,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:53,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561398928] [2024-09-11 20:07:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:53,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:53,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:53,907 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:07:53,912 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-11 20:07:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:53,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-11 20:07:53,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-09-11 20:07:54,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-09-11 20:07:56,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:56,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658617688] [2024-09-11 20:07:56,524 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:07:56,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561398928] [2024-09-11 20:07:56,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561398928] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:07:56,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:07:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 29 [2024-09-11 20:07:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025926186] [2024-09-11 20:07:56,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:07:56,525 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-11 20:07:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:56,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-11 20:07:56,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-09-11 20:07:56,527 INFO L87 Difference]: Start difference. First operand 110 states and 144 transitions. Second operand has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 26 states have internal predecessors, (52), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 13 states have call predecessors, (34), 16 states have call successors, (34) [2024-09-11 20:07:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:07:57,315 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2024-09-11 20:07:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-11 20:07:57,316 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 26 states have internal predecessors, (52), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 13 states have call predecessors, (34), 16 states have call successors, (34) Word has length 105 [2024-09-11 20:07:57,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:07:57,317 INFO L225 Difference]: With dead ends: 134 [2024-09-11 20:07:57,317 INFO L226 Difference]: Without dead ends: 91 [2024-09-11 20:07:57,318 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2024-09-11 20:07:57,318 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:07:57,318 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 375 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:07:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-09-11 20:07:57,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-09-11 20:07:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 58 states have internal predecessors, (58), 20 states have call successors, (20), 13 states have call predecessors, (20), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-11 20:07:57,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2024-09-11 20:07:57,342 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 105 [2024-09-11 20:07:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:07:57,342 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2024-09-11 20:07:57,342 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.793103448275862) internal successors, (52), 26 states have internal predecessors, (52), 16 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (34), 13 states have call predecessors, (34), 16 states have call successors, (34) [2024-09-11 20:07:57,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2024-09-11 20:07:57,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-09-11 20:07:57,343 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:07:57,343 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:07:57,359 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-11 20:07:57,547 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-11 20:07:57,548 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:07:57,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:07:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash -663832148, now seen corresponding path program 1 times [2024-09-11 20:07:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:07:57,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623516781] [2024-09-11 20:07:57,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:57,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:07:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:07:57,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368917852] [2024-09-11 20:07:57,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:07:57,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:07:57,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:07:57,575 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:07:57,576 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-11 20:07:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:07:57,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-11 20:07:57,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:07:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 64 proven. 72 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-09-11 20:07:58,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:07:59,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:07:59,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623516781] [2024-09-11 20:07:59,794 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:07:59,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368917852] [2024-09-11 20:07:59,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368917852] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:07:59,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:07:59,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-09-11 20:07:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114037854] [2024-09-11 20:07:59,795 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:07:59,795 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-11 20:07:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:07:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-11 20:07:59,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-09-11 20:07:59,797 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 9 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2024-09-11 20:08:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:00,226 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-09-11 20:08:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:08:00,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 9 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 111 [2024-09-11 20:08:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:00,227 INFO L225 Difference]: With dead ends: 97 [2024-09-11 20:08:00,227 INFO L226 Difference]: Without dead ends: 93 [2024-09-11 20:08:00,228 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2024-09-11 20:08:00,228 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:00,228 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 411 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:08:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-11 20:08:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-09-11 20:08:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.0) internal successors, (59), 59 states have internal predecessors, (59), 20 states have call successors, (20), 14 states have call predecessors, (20), 13 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-09-11 20:08:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2024-09-11 20:08:00,267 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 111 [2024-09-11 20:08:00,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:00,268 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2024-09-11 20:08:00,268 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 9 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2024-09-11 20:08:00,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2024-09-11 20:08:00,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-09-11 20:08:00,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:00,269 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:00,286 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-11 20:08:00,470 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-11 20:08:00,470 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:00,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:00,470 INFO L85 PathProgramCache]: Analyzing trace with hash 683583031, now seen corresponding path program 1 times [2024-09-11 20:08:00,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:00,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545210789] [2024-09-11 20:08:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:08:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:08:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:08:00,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:08:00,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:08:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:08:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:08:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:08:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:08:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:08:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:08:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-11 20:08:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-11 20:08:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-11 20:08:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-11 20:08:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-09-11 20:08:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-11 20:08:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-11 20:08:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,877 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-09-11 20:08:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-11 20:08:00,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545210789] [2024-09-11 20:08:00,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545210789] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:08:00,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459948991] [2024-09-11 20:08:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:00,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:00,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:00,883 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:08:00,884 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-11 20:08:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:00,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-11 20:08:00,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 31 proven. 74 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-11 20:08:01,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 31 proven. 74 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-11 20:08:02,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459948991] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:08:02,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:08:02,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 26 [2024-09-11 20:08:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830495173] [2024-09-11 20:08:02,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:02,103 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-11 20:08:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:02,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-11 20:08:02,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-09-11 20:08:02,104 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 23 states have internal predecessors, (60), 19 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (48), 17 states have call predecessors, (48), 19 states have call successors, (48) [2024-09-11 20:08:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:02,530 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-09-11 20:08:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:08:02,531 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 23 states have internal predecessors, (60), 19 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (48), 17 states have call predecessors, (48), 19 states have call successors, (48) Word has length 116 [2024-09-11 20:08:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:02,532 INFO L225 Difference]: With dead ends: 93 [2024-09-11 20:08:02,532 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:08:02,532 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2024-09-11 20:08:02,533 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:02,533 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 346 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:08:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:08:02,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:08:02,533 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-11 20:08:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:08:02,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2024-09-11 20:08:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:02,534 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:08:02,534 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 23 states have internal predecessors, (60), 19 states have call successors, (50), 3 states have call predecessors, (50), 2 states have return successors, (48), 17 states have call predecessors, (48), 19 states have call successors, (48) [2024-09-11 20:08:02,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:08:02,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:08:02,538 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:08:02,552 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-11 20:08:02,738 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-11 20:08:02,741 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:02,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:08:05,138 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:08:05,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:08:05 BoogieIcfgContainer [2024-09-11 20:08:05,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:08:05,158 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:08:05,158 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:08:05,158 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:08:05,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:07:37" (3/4) ... [2024-09-11 20:08:05,161 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:08:05,164 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-11 20:08:05,164 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 20:08:05,168 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-11 20:08:05,168 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:08:05,169 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:08:05,169 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:08:05,257 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:08:05,257 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:08:05,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:08:05,258 INFO L158 Benchmark]: Toolchain (without parser) took 28086.83ms. Allocated memory was 151.0MB in the beginning and 406.8MB in the end (delta: 255.9MB). Free memory was 80.5MB in the beginning and 295.9MB in the end (delta: -215.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-09-11 20:08:05,258 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory was 104.9MB in the beginning and 104.7MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:08:05,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.41ms. Allocated memory is still 151.0MB. Free memory was 80.2MB in the beginning and 120.9MB in the end (delta: -40.7MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-09-11 20:08:05,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.72ms. Allocated memory is still 151.0MB. Free memory was 120.9MB in the beginning and 123.0MB in the end (delta: -2.1MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2024-09-11 20:08:05,259 INFO L158 Benchmark]: Boogie Preprocessor took 46.73ms. Allocated memory is still 151.0MB. Free memory was 123.0MB in the beginning and 121.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:08:05,259 INFO L158 Benchmark]: RCFGBuilder took 311.33ms. Allocated memory is still 151.0MB. Free memory was 121.0MB in the beginning and 108.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:08:05,259 INFO L158 Benchmark]: TraceAbstraction took 27325.35ms. Allocated memory was 151.0MB in the beginning and 406.8MB in the end (delta: 255.9MB). Free memory was 107.2MB in the beginning and 301.2MB in the end (delta: -193.9MB). Peak memory consumption was 230.5MB. Max. memory is 16.1GB. [2024-09-11 20:08:05,260 INFO L158 Benchmark]: Witness Printer took 100.09ms. Allocated memory is still 406.8MB. Free memory was 301.2MB in the beginning and 295.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 20:08:05,265 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.21ms. Allocated memory is still 151.0MB. Free memory was 104.9MB in the beginning and 104.7MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.41ms. Allocated memory is still 151.0MB. Free memory was 80.2MB in the beginning and 120.9MB in the end (delta: -40.7MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.72ms. Allocated memory is still 151.0MB. Free memory was 120.9MB in the beginning and 123.0MB in the end (delta: -2.1MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.73ms. Allocated memory is still 151.0MB. Free memory was 123.0MB in the beginning and 121.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 311.33ms. Allocated memory is still 151.0MB. Free memory was 121.0MB in the beginning and 108.1MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27325.35ms. Allocated memory was 151.0MB in the beginning and 406.8MB in the end (delta: 255.9MB). Free memory was 107.2MB in the beginning and 301.2MB in the end (delta: -193.9MB). Peak memory consumption was 230.5MB. Max. memory is 16.1GB. * Witness Printer took 100.09ms. Allocated memory is still 406.8MB. Free memory was 301.2MB in the beginning and 295.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 17]: 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 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 16, TraceHistogramMax: 17, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 378 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 3672 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3088 mSDsCounter, 372 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2538 IncrementalHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 372 mSolverCounterUnsat, 584 mSDtfsCounter, 2538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2012 GetRequests, 1768 SyntacticMatches, 10 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=13, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 110 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 2060 NumberOfCodeBlocks, 2033 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2271 ConstructedInterpolants, 0 QuantifiedInterpolants, 15736 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2079 ConjunctsInSsa, 278 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 6729/7295 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: 46]: Loop Invariant Derived loop invariant: (((((((((((((p == 4) && (r <= 2)) && (q == 0)) && (r == (A % 4294967296))) && (((__int128) r + 1) <= d)) && ((d % 2) == 0)) && ((d / 2) <= r)) && (((d / 2) + (A % 4294967296)) == (((long long) 2 * (B % 4294967296)) + r))) || ((((((d == 1) && (p == 1)) && ((B % 4294967296) == 1)) && (r == 0)) && (2 == q)) && (2 == (A % 4294967296)))) || ((((((((A % 4294967296) <= 2) && (2 == p)) && (((long long) 2 * (B % 4294967296)) == d)) && (q == 0)) && (r == (A % 4294967296))) && (((__int128) r + 1) <= d)) && ((d / 2) <= r))) || ((((((2 == p) && ((B % 4294967296) == 1)) && (r == 0)) && (2 == q)) && (2 == (A % 4294967296))) && (2 == d))) || ((((((((r + (B % 4294967296)) == (A % 4294967296)) && (p == 1)) && ((A % 4294967296) <= 2)) && (0 <= r)) && (q == 1)) && ((d + (A % 4294967296)) == (((long long) 2 * (B % 4294967296)) + r))) && (((__int128) r + 1) <= d))) || ((((p == 1) && (q == 0)) && ((((B / 4294967296) * 4294967296) + d) == B)) && (r == (A % 4294967296)))) - InvariantResult [Line: 61]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((((((((2 == p) && (((long long) 2 * (B % 4294967296)) == d)) && (r <= 2)) && (q == 0)) && (1 <= d)) && (r == (A % 4294967296))) && ((d / 2) <= r)) || ((((((((p == 4) && (r <= 2)) && (q == 0)) && (1 <= d)) && (r == (A % 4294967296))) && ((d % 2) == 0)) && ((d / 2) <= r)) && (((d / 2) + (A % 4294967296)) == (((long long) 2 * (B % 4294967296)) + r)))) || ((((((p == 1) && (r <= 2)) && (q == 0)) && ((((B / 4294967296) * 4294967296) + d) == B)) && (1 <= d)) && (r == (A % 4294967296)))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:08:05,326 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