./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i --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/divbin_unwindbound5.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 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 --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 19:49:42,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:49:42,769 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:49:42,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:49:42,773 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:49:42,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:49:42,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:49:42,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:49:42,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:49:42,798 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:49:42,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:49:42,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:49:42,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:49:42,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:49:42,802 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:49:42,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:49:42,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:49:42,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:49:42,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:49:42,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:49:42,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:49:42,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:49:42,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:49:42,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:49:42,808 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:49:42,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:49:42,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:49:42,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:49:42,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:49:42,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:49:42,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:49:42,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:49:42,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:49:42,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:49:42,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:49:42,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:49:42,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:49:42,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:49:42,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:49:42,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:49:42,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:49:42,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:49:42,812 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 -> 3d0e3bce6f4731d98bf8e5301c405fc62948194b21f76143536933e108212a93 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 19:49:43,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:49:43,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:49:43,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:49:43,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:49:43,072 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:49:43,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2024-09-11 19:49:44,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:49:44,668 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:49:44,668 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/divbin_unwindbound5.i [2024-09-11 19:49:44,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b65cd9b19/7fedda2817e34ccfa591bcce105db0bb/FLAGce5cbc207 [2024-09-11 19:49:45,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b65cd9b19/7fedda2817e34ccfa591bcce105db0bb [2024-09-11 19:49:45,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:49:45,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:49:45,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:49:45,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:49:45,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:49:45,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fd17ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45, skipping insertion in model container [2024-09-11 19:49:45,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:49:45,311 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/divbin_unwindbound5.i[950,963] [2024-09-11 19:49:45,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:49:45,355 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:49:45,367 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/divbin_unwindbound5.i[950,963] [2024-09-11 19:49:45,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:49:45,402 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:49:45,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45 WrapperNode [2024-09-11 19:49:45,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:49:45,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:49:45,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:49:45,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:49:45,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,434 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2024-09-11 19:49:45,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:49:45,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:49:45,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:49:45,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:49:45,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,470 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 19:49:45,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,481 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:49:45,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:49:45,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:49:45,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:49:45,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (1/1) ... [2024-09-11 19:49:45,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:49:45,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:45,516 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 19:49:45,519 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 19:49:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:49:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 19:49:45,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 19:49:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:49:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:49:45,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:49:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:49:45,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:49:45,611 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:49:45,612 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:49:45,722 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 19:49:45,722 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:49:45,746 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:49:45,746 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 19:49:45,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:49:45 BoogieIcfgContainer [2024-09-11 19:49:45,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:49:45,748 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:49:45,748 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:49:45,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:49:45,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:49:45" (1/3) ... [2024-09-11 19:49:45,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63052114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:49:45, skipping insertion in model container [2024-09-11 19:49:45,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:49:45" (2/3) ... [2024-09-11 19:49:45,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63052114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:49:45, skipping insertion in model container [2024-09-11 19:49:45,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:49:45" (3/3) ... [2024-09-11 19:49:45,753 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound5.i [2024-09-11 19:49:45,766 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:49:45,766 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:49:45,807 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:49:45,812 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;@226948ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:49:45,812 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:49:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:49:45,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 19:49:45,824 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:45,825 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:49:45,826 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:45,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash -627064806, now seen corresponding path program 1 times [2024-09-11 19:49:45,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:45,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147258559] [2024-09-11 19:49:45,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:45,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:46,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:49:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:46,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:49:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:49:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:46,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147258559] [2024-09-11 19:49:46,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147258559] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:49:46,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:49:46,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:49:46,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481751814] [2024-09-11 19:49:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:49:46,058 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:49:46,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:46,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:49:46,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:49:46,083 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:49:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:46,117 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2024-09-11 19:49:46,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:49:46,122 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-11 19:49:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:46,137 INFO L225 Difference]: With dead ends: 48 [2024-09-11 19:49:46,141 INFO L226 Difference]: Without dead ends: 23 [2024-09-11 19:49:46,144 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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 19:49:46,152 INFO L434 NwaCegarLoop]: 29 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, 29 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 19:49:46,153 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:49:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-11 19:49:46,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-11 19:49:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 19:49:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-09-11 19:49:46,198 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2024-09-11 19:49:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:46,199 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-09-11 19:49:46,199 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 19:49:46,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-09-11 19:49:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 19:49:46,202 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:46,202 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:49:46,203 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:49:46,203 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:46,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:46,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1502675692, now seen corresponding path program 1 times [2024-09-11 19:49:46,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:46,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714934976] [2024-09-11 19:49:46,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:46,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:46,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:49:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:46,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:49:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:49:46,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:46,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714934976] [2024-09-11 19:49:46,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714934976] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:49:46,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:49:46,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 19:49:46,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850329183] [2024-09-11 19:49:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:49:46,406 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 19:49:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:46,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 19:49:46,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:49:46,409 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:49:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:46,435 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-09-11 19:49:46,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 19:49:46,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-11 19:49:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:46,439 INFO L225 Difference]: With dead ends: 37 [2024-09-11 19:49:46,439 INFO L226 Difference]: Without dead ends: 25 [2024-09-11 19:49:46,440 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 19:49:46,441 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 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-11 19:49:46,441 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:49:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-11 19:49:46,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-11 19:49:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 19:49:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2024-09-11 19:49:46,457 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 20 [2024-09-11 19:49:46,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:46,458 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2024-09-11 19:49:46,459 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:49:46,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:46,460 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2024-09-11 19:49:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 19:49:46,461 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:46,462 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:49:46,462 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:49:46,463 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:46,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:46,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1051975660, now seen corresponding path program 1 times [2024-09-11 19:49:46,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:46,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541512217] [2024-09-11 19:49:46,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:46,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:49:46,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [215776725] [2024-09-11 19:49:46,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:46,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:49:46,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:46,519 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 19:49:46,522 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 19:49:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:46,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 19:49:46,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:49:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:49:46,716 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:49:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541512217] [2024-09-11 19:49:46,717 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:49:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215776725] [2024-09-11 19:49:46,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215776725] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:49:46,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:49:46,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:49:46,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871439681] [2024-09-11 19:49:46,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:49:46,723 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:49:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:46,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:49:46,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:49:46,725 INFO L87 Difference]: Start difference. First operand 25 states and 31 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:49:46,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:46,801 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-09-11 19:49:46,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:49:46,802 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-09-11 19:49:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:46,803 INFO L225 Difference]: With dead ends: 37 [2024-09-11 19:49:46,804 INFO L226 Difference]: Without dead ends: 34 [2024-09-11 19:49:46,804 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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 19:49:46,807 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:49:46,808 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 75 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:49:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-11 19:49:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-11 19:49:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:49:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-09-11 19:49:46,824 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 21 [2024-09-11 19:49:46,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:46,825 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-09-11 19:49:46,825 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:49:46,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:46,826 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-09-11 19:49:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-11 19:49:46,827 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:46,827 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:49:46,845 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 19:49:47,031 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-11 19:49:47,032 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:47,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1831455308, now seen corresponding path program 1 times [2024-09-11 19:49:47,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:47,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662289035] [2024-09-11 19:49:47,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:47,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:49:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:47,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:49:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:47,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:49:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:49:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:47,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662289035] [2024-09-11 19:49:47,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662289035] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:49:47,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:49:47,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:49:47,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219556351] [2024-09-11 19:49:47,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:49:47,482 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:49:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:47,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:49:47,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:49:47,483 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 19:49:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:47,524 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2024-09-11 19:49:47,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:49:47,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-09-11 19:49:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:47,525 INFO L225 Difference]: With dead ends: 60 [2024-09-11 19:49:47,525 INFO L226 Difference]: Without dead ends: 35 [2024-09-11 19:49:47,526 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:49:47,527 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 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-11 19:49:47,527 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:49:47,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-11 19:49:47,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-11 19:49:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:49:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-09-11 19:49:47,542 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 30 [2024-09-11 19:49:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:47,543 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-09-11 19:49:47,543 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 19:49:47,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-09-11 19:49:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-11 19:49:47,547 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:47,547 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:49:47,547 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:49:47,547 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:47,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:47,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1020028593, now seen corresponding path program 1 times [2024-09-11 19:49:47,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:47,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545738113] [2024-09-11 19:49:47,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:47,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:47,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:49:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:47,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:49:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:47,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:49:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-11 19:49:47,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:49:47,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545738113] [2024-09-11 19:49:47,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545738113] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:49:47,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312060208] [2024-09-11 19:49:47,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:47,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:49:47,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:47,689 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 19:49:47,691 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 19:49:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:47,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-11 19:49:47,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:49:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:49:47,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:49:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-11 19:49:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312060208] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:49:47,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:49:47,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-09-11 19:49:47,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883653763] [2024-09-11 19:49:47,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:49:47,870 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:49:47,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:49:47,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:49:47,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:49:47,871 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-11 19:49:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:49:47,961 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2024-09-11 19:49:47,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:49:47,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 32 [2024-09-11 19:49:47,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:49:47,963 INFO L225 Difference]: With dead ends: 75 [2024-09-11 19:49:47,963 INFO L226 Difference]: Without dead ends: 54 [2024-09-11 19:49:47,964 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:49:47,964 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:49:47,965 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 123 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:49:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-11 19:49:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 43. [2024-09-11 19:49:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:49:47,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-09-11 19:49:47,988 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 32 [2024-09-11 19:49:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:49:47,988 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-09-11 19:49:47,988 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-11 19:49:47,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-09-11 19:49:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-11 19:49:47,990 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:49:47,990 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:49:48,007 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 19:49:48,190 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 19:49:48,191 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:49:48,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:49:48,191 INFO L85 PathProgramCache]: Analyzing trace with hash -736358239, now seen corresponding path program 1 times [2024-09-11 19:49:48,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:49:48,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162942678] [2024-09-11 19:49:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:48,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:49:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:49:48,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415248553] [2024-09-11 19:49:48,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:49:48,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:49:48,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:49:48,256 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 19:49:48,258 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 19:49:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:49:48,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-11 19:49:48,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:49:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:49:48,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:06,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:06,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162942678] [2024-09-11 19:50:06,127 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 19:50:06,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415248553] [2024-09-11 19:50:06,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415248553] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:50:06,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:50:06,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-09-11 19:50:06,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957623626] [2024-09-11 19:50:06,128 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 19:50:06,129 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:50:06,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:06,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:50:06,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=146, Unknown=4, NotChecked=0, Total=182 [2024-09-11 19:50:06,130 INFO L87 Difference]: Start difference. First operand 43 states and 52 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, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 19:50:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:50:06,300 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-09-11 19:50:06,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:50:06,301 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, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-09-11 19:50:06,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:50:06,303 INFO L225 Difference]: With dead ends: 54 [2024-09-11 19:50:06,303 INFO L226 Difference]: Without dead ends: 51 [2024-09-11 19:50:06,303 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=38, Invalid=168, Unknown=4, NotChecked=0, Total=210 [2024-09-11 19:50:06,304 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:50:06,304 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 122 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:50:06,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-11 19:50:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-09-11 19:50:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.225) internal successors, (49), 41 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:50:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2024-09-11 19:50:06,317 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 33 [2024-09-11 19:50:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:50:06,317 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-09-11 19:50:06,317 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, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 19:50:06,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-09-11 19:50:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-11 19:50:06,319 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:06,319 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:06,328 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 19:50:06,519 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 19:50:06,520 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:06,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1620601913, now seen corresponding path program 2 times [2024-09-11 19:50:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714523577] [2024-09-11 19:50:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:07,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:50:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:07,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:50:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:07,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-11 19:50:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:07,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 19:50:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:50:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714523577] [2024-09-11 19:50:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714523577] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:50:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020583322] [2024-09-11 19:50:07,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:50:07,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:07,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:50:07,122 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 19:50:07,123 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 19:50:07,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:50:07,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:50:07,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 19:50:07,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:50:08,067 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 19:50:08,068 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 19:50:15,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020583322] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:50:15,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:50:15,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 15] total 30 [2024-09-11 19:50:15,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321072044] [2024-09-11 19:50:15,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:50:15,577 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-11 19:50:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:15,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-11 19:50:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=717, Unknown=0, NotChecked=0, Total=870 [2024-09-11 19:50:15,580 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 24 states have internal predecessors, (67), 10 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-11 19:50:16,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:50:16,832 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2024-09-11 19:50:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 19:50:16,833 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 24 states have internal predecessors, (67), 10 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Word has length 42 [2024-09-11 19:50:16,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:50:16,834 INFO L225 Difference]: With dead ends: 107 [2024-09-11 19:50:16,834 INFO L226 Difference]: Without dead ends: 61 [2024-09-11 19:50:16,835 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2024-09-11 19:50:16,835 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:50:16,836 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 246 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-11 19:50:16,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-11 19:50:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2024-09-11 19:50:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 40 states have (on average 1.2) internal successors, (48), 41 states have internal predecessors, (48), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 19:50:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2024-09-11 19:50:16,856 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 42 [2024-09-11 19:50:16,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:50:16,857 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2024-09-11 19:50:16,858 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 24 states have internal predecessors, (67), 10 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-11 19:50:16,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2024-09-11 19:50:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 19:50:16,859 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:16,859 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:16,877 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 19:50:17,061 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:17,062 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:17,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2080148684, now seen corresponding path program 3 times [2024-09-11 19:50:17,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:17,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660840666] [2024-09-11 19:50:17,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:17,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:50:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:17,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:50:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:17,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 19:50:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:17,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 19:50:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:50:17,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:50:17,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660840666] [2024-09-11 19:50:17,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660840666] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:50:17,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446471621] [2024-09-11 19:50:17,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:50:17,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:17,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:50:17,335 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 19:50:17,339 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 19:50:17,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-11 19:50:17,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:50:17,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 19:50:17,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:50:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:50:17,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:50:17,960 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:50:17,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446471621] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:50:17,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:50:17,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 11 [2024-09-11 19:50:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058003835] [2024-09-11 19:50:17,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:50:17,961 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 19:50:17,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:50:17,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 19:50:17,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-09-11 19:50:17,962 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-11 19:50:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:50:18,073 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2024-09-11 19:50:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:50:18,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 45 [2024-09-11 19:50:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:50:18,075 INFO L225 Difference]: With dead ends: 93 [2024-09-11 19:50:18,075 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 19:50:18,075 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 90 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:50:18,076 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 33 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:50:18,076 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 163 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:50:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 19:50:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-11 19:50:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 19:50:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-09-11 19:50:18,084 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 45 [2024-09-11 19:50:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:50:18,084 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-09-11 19:50:18,085 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-11 19:50:18,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-09-11 19:50:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 19:50:18,086 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:50:18,086 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:50:18,096 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 19:50:18,287 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-11 19:50:18,287 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:50:18,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:50:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2081936144, now seen corresponding path program 1 times [2024-09-11 19:50:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:50:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209978496] [2024-09-11 19:50:18,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:50:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 19:50:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868816145] [2024-09-11 19:50:18,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:50:18,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:50:18,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:50:18,445 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 19:50:18,447 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 19:50:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:50:19,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-09-11 19:50:19,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:52:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 19:52:44,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:53:36,519 WARN L293 SmtUtils]: Spent 16.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 19:53:56,871 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)