./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-new/nested-1.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-new/nested-1.i -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 3baf312ca85439572472b3c02ed304b3157fa97373d6ada535e5a723c6c0219a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:25:14,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:25:14,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:25:14,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:25:14,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:25:14,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:25:14,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:25:14,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:25:14,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:25:14,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:25:14,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:25:14,456 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:25:14,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:25:14,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:25:14,459 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:25:14,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:25:14,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:25:14,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:25:14,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:25:14,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:25:14,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:25:14,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:25:14,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:25:14,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:25:14,462 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:25:14,462 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:25:14,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:25:14,462 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:25:14,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:25:14,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:25:14,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:25:14,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:25:14,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:25:14,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:25:14,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:25:14,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:25:14,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:25:14,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:25:14,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:25:14,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:25:14,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:25:14,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:25:14,469 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 -> 3baf312ca85439572472b3c02ed304b3157fa97373d6ada535e5a723c6c0219a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:25:14,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:25:14,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:25:14,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:25:14,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:25:14,799 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:25:14,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-new/nested-1.i [2024-09-25 10:25:16,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:25:16,418 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:25:16,419 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-new/nested-1.i [2024-09-25 10:25:16,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/fefa0b956/b269f83159374e9397c4b5c8b0e86be9/FLAG45e95888a [2024-09-25 10:25:16,445 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/fefa0b956/b269f83159374e9397c4b5c8b0e86be9 [2024-09-25 10:25:16,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:25:16,450 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:25:16,452 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:25:16,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:25:16,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:25:16,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6944aae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16, skipping insertion in model container [2024-09-25 10:25:16,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:25:16,664 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-new/nested-1.i[891,904] [2024-09-25 10:25:16,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:25:16,697 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:25:16,710 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-new/nested-1.i[891,904] [2024-09-25 10:25:16,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:25:16,733 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:25:16,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16 WrapperNode [2024-09-25 10:25:16,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:25:16,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:25:16,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:25:16,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:25:16,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,756 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:25:16,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:25:16,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:25:16,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:25:16,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:25:16,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,784 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-25 10:25:16,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:25:16,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:25:16,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:25:16,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:25:16,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (1/1) ... [2024-09-25 10:25:16,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:25:16,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:16,835 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-25 10:25:16,843 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-25 10:25:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:25:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:25:16,890 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:25:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:25:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:25:16,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:25:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:25:16,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:25:16,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:25:16,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:25:16,947 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:25:16,949 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:25:17,116 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-09-25 10:25:17,117 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:25:17,152 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:25:17,152 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:25:17,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:25:17 BoogieIcfgContainer [2024-09-25 10:25:17,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:25:17,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:25:17,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:25:17,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:25:17,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:25:16" (1/3) ... [2024-09-25 10:25:17,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4ea2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:25:17, skipping insertion in model container [2024-09-25 10:25:17,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:25:16" (2/3) ... [2024-09-25 10:25:17,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4ea2c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:25:17, skipping insertion in model container [2024-09-25 10:25:17,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:25:17" (3/3) ... [2024-09-25 10:25:17,169 INFO L112 eAbstractionObserver]: Analyzing ICFG nested-1.i [2024-09-25 10:25:17,185 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:25:17,186 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:25:17,249 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:25:17,258 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;@bd3acaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:25:17,258 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:25:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:25:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 10:25:17,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:17,269 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:17,270 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:17,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash 872705061, now seen corresponding path program 1 times [2024-09-25 10:25:17,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:17,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194036198] [2024-09-25 10:25:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:17,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:17,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:17,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194036198] [2024-09-25 10:25:17,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194036198] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:25:17,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:25:17,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:25:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133540369] [2024-09-25 10:25:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:25:17,558 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:25:17,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:17,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:25:17,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:25:17,581 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:17,652 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2024-09-25 10:25:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:25:17,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-25 10:25:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:17,662 INFO L225 Difference]: With dead ends: 42 [2024-09-25 10:25:17,663 INFO L226 Difference]: Without dead ends: 18 [2024-09-25 10:25:17,666 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:25:17,671 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:17,672 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 55 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:25:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-25 10:25:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-09-25 10:25:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-09-25 10:25:17,708 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2024-09-25 10:25:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:17,710 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-09-25 10:25:17,710 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:17,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-09-25 10:25:17,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 10:25:17,713 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:17,713 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:17,713 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:25:17,713 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:17,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:17,714 INFO L85 PathProgramCache]: Analyzing trace with hash -569299606, now seen corresponding path program 1 times [2024-09-25 10:25:17,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776991232] [2024-09-25 10:25:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:17,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:17,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:17,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776991232] [2024-09-25 10:25:17,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776991232] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:25:17,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:25:17,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:25:17,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953219307] [2024-09-25 10:25:17,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:25:17,832 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:25:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:17,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:25:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:25:17,835 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:17,866 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-09-25 10:25:17,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:25:17,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-25 10:25:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:17,868 INFO L225 Difference]: With dead ends: 25 [2024-09-25 10:25:17,869 INFO L226 Difference]: Without dead ends: 17 [2024-09-25 10:25:17,869 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:25:17,871 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:17,872 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:25:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-25 10:25:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-25 10:25:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-09-25 10:25:17,884 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2024-09-25 10:25:17,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:17,885 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-09-25 10:25:17,885 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:17,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-09-25 10:25:17,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:25:17,887 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:17,887 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:17,887 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:25:17,888 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:17,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1171897962, now seen corresponding path program 1 times [2024-09-25 10:25:17,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327503386] [2024-09-25 10:25:17,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:18,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:18,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327503386] [2024-09-25 10:25:18,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327503386] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:18,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344193370] [2024-09-25 10:25:18,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:18,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:18,072 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-25 10:25:18,074 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-25 10:25:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:18,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:25:18,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:18,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:25:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344193370] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:25:18,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:25:18,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-09-25 10:25:18,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806972870] [2024-09-25 10:25:18,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:25:18,235 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:25:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:25:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:25:18,238 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:18,283 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-25 10:25:18,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:25:18,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:25:18,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:18,288 INFO L225 Difference]: With dead ends: 29 [2024-09-25 10:25:18,288 INFO L226 Difference]: Without dead ends: 20 [2024-09-25 10:25:18,289 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:25:18,290 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:18,290 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:25:18,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-25 10:25:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-09-25 10:25:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2024-09-25 10:25:18,297 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2024-09-25 10:25:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:18,297 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2024-09-25 10:25:18,298 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:18,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2024-09-25 10:25:18,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:25:18,299 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:18,299 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:18,313 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:25:18,502 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:18,503 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:18,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:18,503 INFO L85 PathProgramCache]: Analyzing trace with hash -993339286, now seen corresponding path program 2 times [2024-09-25 10:25:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:18,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001391790] [2024-09-25 10:25:18,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:18,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:18,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:18,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001391790] [2024-09-25 10:25:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001391790] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868722400] [2024-09-25 10:25:18,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:25:18,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:18,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:18,651 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-25 10:25:18,652 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-25 10:25:18,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:25:18,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:25:18,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:25:18,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:18,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:25:18,908 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:25:18,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868722400] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:25:18,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:25:18,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-09-25 10:25:18,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460225838] [2024-09-25 10:25:18,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:25:18,910 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 10:25:18,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:18,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 10:25:18,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:25:18,913 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:19,038 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-09-25 10:25:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:25:19,039 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-25 10:25:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:19,042 INFO L225 Difference]: With dead ends: 38 [2024-09-25 10:25:19,042 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 10:25:19,042 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:25:19,043 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:19,044 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:25:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 10:25:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-25 10:25:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-09-25 10:25:19,057 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 19 [2024-09-25 10:25:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:19,058 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-09-25 10:25:19,058 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:19,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-09-25 10:25:19,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 10:25:19,059 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:19,059 INFO L216 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:19,080 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:25:19,266 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:19,267 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:19,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:19,267 INFO L85 PathProgramCache]: Analyzing trace with hash -2126771990, now seen corresponding path program 3 times [2024-09-25 10:25:19,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:19,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924589995] [2024-09-25 10:25:19,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:19,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:19,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-25 10:25:19,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:19,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924589995] [2024-09-25 10:25:19,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924589995] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:19,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182065400] [2024-09-25 10:25:19,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:25:19,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:19,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:19,387 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-25 10:25:19,389 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-25 10:25:19,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-25 10:25:19,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:25:19,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:25:19,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:19,531 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-25 10:25:19,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:25:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-25 10:25:19,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182065400] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:25:19,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:25:19,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-09-25 10:25:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680030605] [2024-09-25 10:25:19,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:25:19,582 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:25:19,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:19,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:25:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:25:19,584 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:19,652 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-09-25 10:25:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:25:19,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-09-25 10:25:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:19,654 INFO L225 Difference]: With dead ends: 70 [2024-09-25 10:25:19,654 INFO L226 Difference]: Without dead ends: 65 [2024-09-25 10:25:19,655 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:25:19,655 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:19,656 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 51 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:25:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-25 10:25:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-09-25 10:25:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 60 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2024-09-25 10:25:19,676 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 25 [2024-09-25 10:25:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:19,676 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2024-09-25 10:25:19,676 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:19,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2024-09-25 10:25:19,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-09-25 10:25:19,680 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:19,680 INFO L216 NwaCegarLoop]: trace histogram [40, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:19,697 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:25:19,880 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:19,881 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:19,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:19,881 INFO L85 PathProgramCache]: Analyzing trace with hash -541600667, now seen corresponding path program 4 times [2024-09-25 10:25:19,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:19,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995237155] [2024-09-25 10:25:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:20,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 10:25:20,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995237155] [2024-09-25 10:25:20,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995237155] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756010739] [2024-09-25 10:25:20,111 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:25:20,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:20,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:20,114 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-25 10:25:20,116 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-25 10:25:20,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:25:20,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:25:20,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:25:20,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 10:25:20,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:25:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 962 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 10:25:20,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756010739] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:25:20,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:25:20,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-09-25 10:25:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707958890] [2024-09-25 10:25:20,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:25:20,622 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 10:25:20,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:20,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 10:25:20,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:25:20,623 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:20,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:20,788 INFO L93 Difference]: Finished difference Result 148 states and 163 transitions. [2024-09-25 10:25:20,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:25:20,788 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-09-25 10:25:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:20,790 INFO L225 Difference]: With dead ends: 148 [2024-09-25 10:25:20,790 INFO L226 Difference]: Without dead ends: 143 [2024-09-25 10:25:20,791 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:25:20,791 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:20,792 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 63 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:25:20,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-09-25 10:25:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-09-25 10:25:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.0797101449275361) internal successors, (149), 138 states have internal predecessors, (149), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2024-09-25 10:25:20,828 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 64 [2024-09-25 10:25:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:20,829 INFO L474 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2024-09-25 10:25:20,830 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:20,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2024-09-25 10:25:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-09-25 10:25:20,831 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:25:20,832 INFO L216 NwaCegarLoop]: trace histogram [100, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:25:20,850 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:25:21,032 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:21,032 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:25:21,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:21,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2054576955, now seen corresponding path program 5 times [2024-09-25 10:25:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:25:21,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716769348] [2024-09-25 10:25:21,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:25:21,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:25:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:27,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:25:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:25:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 5967 proven. 119 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:25:27,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:25:27,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716769348] [2024-09-25 10:25:27,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716769348] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:25:27,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138398093] [2024-09-25 10:25:27,330 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:25:27,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:25:27,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:25:27,336 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-25 10:25:27,342 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-25 10:25:27,523 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2024-09-25 10:25:27,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:25:27,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 104 conjuncts are in the unsatisfiable core [2024-09-25 10:25:27,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:25:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6095 backedges. 6086 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:25:27,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:25:27,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138398093] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:25:27,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:25:27,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [105] imperfect sequences [105] total 108 [2024-09-25 10:25:27,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914794651] [2024-09-25 10:25:27,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:25:27,848 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2024-09-25 10:25:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:25:27,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2024-09-25 10:25:27,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5266, Invalid=6290, Unknown=0, NotChecked=0, Total=11556 [2024-09-25 10:25:27,855 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand has 105 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 104 states have internal predecessors, (138), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:25:29,187 INFO L93 Difference]: Finished difference Result 5588 states and 6048 transitions. [2024-09-25 10:25:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-09-25 10:25:29,187 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 104 states have internal predecessors, (138), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 142 [2024-09-25 10:25:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:25:29,191 INFO L225 Difference]: With dead ends: 5588 [2024-09-25 10:25:29,191 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:25:29,206 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5272, Invalid=6500, Unknown=0, NotChecked=0, Total=11772 [2024-09-25 10:25:29,207 INFO L434 NwaCegarLoop]: 282 mSDtfsCounter, 245 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:25:29,207 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1959 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:25:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:25:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:25:29,208 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-25 10:25:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:25:29,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2024-09-25 10:25:29,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:25:29,211 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:25:29,211 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 1.3142857142857143) internal successors, (138), 104 states have internal predecessors, (138), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:25:29,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:25:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:25:29,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:25:29,214 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:25:29,233 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:25:29,415 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:25:29,418 INFO L408 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2024-09-25 10:25:29,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:25:37,400 WARN L293 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 672 DAG size of output: 670 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)