./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/in-de62.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/in-de62.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de9532d8dfc4a0a0cd7c7b5fdf45ac6c04e52382fa165e3cc41d86867bc75adf --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:29:21,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:29:21,789 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:29:21,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:29:21,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:29:21,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:29:21,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:29:21,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:29:21,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:29:21,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:29:21,818 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:29:21,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:29:21,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:29:21,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:29:21,819 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:29:21,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:29:21,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:29:21,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:29:21,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:29:21,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:29:21,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:29:21,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:29:21,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:29:21,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:29:21,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:29:21,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:29:21,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:29:21,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:29:21,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:29:21,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:29:21,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:29:21,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:29:21,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:29:21,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:29:21,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:29:21,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:29:21,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:29:21,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:29:21,831 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:29:21,831 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:29:21,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:29:21,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:29:21,833 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 -> de9532d8dfc4a0a0cd7c7b5fdf45ac6c04e52382fa165e3cc41d86867bc75adf Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:29:22,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:29:22,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:29:22,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:29:22,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:29:22,085 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:29:22,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/in-de62.c [2024-09-25 10:29:23,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:29:23,420 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:29:23,421 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/in-de62.c [2024-09-25 10:29:23,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e6646ac1d/c7ecec2aa6ac46f590fc95bf601e2823/FLAG5db20cb16 [2024-09-25 10:29:23,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e6646ac1d/c7ecec2aa6ac46f590fc95bf601e2823 [2024-09-25 10:29:23,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:29:23,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:29:23,439 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:29:23,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:29:23,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:29:23,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aacee61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23, skipping insertion in model container [2024-09-25 10:29:23,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:29:23,564 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/in-de62.c[368,381] [2024-09-25 10:29:23,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:29:23,590 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:29:23,601 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/in-de62.c[368,381] [2024-09-25 10:29:23,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:29:23,623 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:29:23,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23 WrapperNode [2024-09-25 10:29:23,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:29:23,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:29:23,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:29:23,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:29:23,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,640 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:29:23,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:29:23,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:29:23,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:29:23,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:29:23,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,669 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:29:23,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,674 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,679 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:29:23,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:29:23,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:29:23,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:29:23,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (1/1) ... [2024-09-25 10:29:23,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:29:23,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:23,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:29:23,715 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:29:23,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:29:23,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:29:23,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:29:23,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:29:23,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:29:23,750 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:29:23,750 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:29:23,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:29:23,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:29:23,751 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:29:23,852 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:29:23,855 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:29:24,008 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-25 10:29:24,009 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:29:24,027 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:29:24,028 INFO L317 CfgBuilder]: Removed 6 assume(true) statements. [2024-09-25 10:29:24,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:29:24 BoogieIcfgContainer [2024-09-25 10:29:24,028 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:29:24,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:29:24,030 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:29:24,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:29:24,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:29:23" (1/3) ... [2024-09-25 10:29:24,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7150043f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:29:24, skipping insertion in model container [2024-09-25 10:29:24,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:29:23" (2/3) ... [2024-09-25 10:29:24,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7150043f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:29:24, skipping insertion in model container [2024-09-25 10:29:24,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:29:24" (3/3) ... [2024-09-25 10:29:24,036 INFO L112 eAbstractionObserver]: Analyzing ICFG in-de62.c [2024-09-25 10:29:24,047 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:29:24,048 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:29:24,084 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:29:24,091 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;@65dd7fa1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:29:24,091 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:29:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:29:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:29:24,099 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:24,100 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:24,100 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:24,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,106 INFO L85 PathProgramCache]: Analyzing trace with hash -294793433, now seen corresponding path program 1 times [2024-09-25 10:29:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:24,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724271761] [2024-09-25 10:29:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:24,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:24,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:24,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:29:24,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:24,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724271761] [2024-09-25 10:29:24,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724271761] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:29:24,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:29:24,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:29:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447285337] [2024-09-25 10:29:24,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:29:24,230 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:29:24,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:29:24,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:29:24,249 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:24,265 INFO L93 Difference]: Finished difference Result 40 states and 63 transitions. [2024-09-25 10:29:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:29:24,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:29:24,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:24,271 INFO L225 Difference]: With dead ends: 40 [2024-09-25 10:29:24,271 INFO L226 Difference]: Without dead ends: 17 [2024-09-25 10:29:24,273 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:29:24,275 INFO L434 NwaCegarLoop]: 26 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, 26 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-25 10:29:24,276 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:29:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-25 10:29:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-25 10:29:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-09-25 10:29:24,304 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 16 [2024-09-25 10:29:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:24,304 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-09-25 10:29:24,304 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-09-25 10:29:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:29:24,305 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:24,306 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:24,306 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:29:24,306 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:24,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash -951970017, now seen corresponding path program 1 times [2024-09-25 10:29:24,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:24,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878203713] [2024-09-25 10:29:24,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:24,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:24,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:29:24,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:24,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878203713] [2024-09-25 10:29:24,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878203713] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:29:24,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:29:24,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:29:24,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129278018] [2024-09-25 10:29:24,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:29:24,545 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:29:24,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:24,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:29:24,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:29:24,548 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.4) 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:24,601 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2024-09-25 10:29:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:29:24,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:29:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:24,602 INFO L225 Difference]: With dead ends: 33 [2024-09-25 10:29:24,602 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:29:24,603 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-25 10:29:24,604 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:24,605 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:29:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:29:24,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 10:29:24,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2024-09-25 10:29:24,612 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 16 [2024-09-25 10:29:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:24,612 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2024-09-25 10:29:24,613 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) 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, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2024-09-25 10:29:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:29:24,614 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:24,614 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:24,615 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:29:24,615 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:24,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash 589238346, now seen corresponding path program 1 times [2024-09-25 10:29:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:24,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624405439] [2024-09-25 10:29:24,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:24,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:24,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:29:24,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:24,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624405439] [2024-09-25 10:29:24,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624405439] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:29:24,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:29:24,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:29:24,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047396528] [2024-09-25 10:29:24,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:29:24,659 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:29:24,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:24,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:29:24,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:29:24,661 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:24,692 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2024-09-25 10:29:24,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:29:24,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-25 10:29:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:24,694 INFO L225 Difference]: With dead ends: 46 [2024-09-25 10:29:24,695 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 10:29:24,695 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:29:24,696 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:24,696 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 29 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:29:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 10:29:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-25 10:29:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2024-09-25 10:29:24,711 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 17 [2024-09-25 10:29:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:24,711 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2024-09-25 10:29:24,712 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2024-09-25 10:29:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:29:24,712 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:24,712 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:24,713 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:29:24,713 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:24,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1992066745, now seen corresponding path program 1 times [2024-09-25 10:29:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:24,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709847301] [2024-09-25 10:29:24,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:24,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:24,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:29:24,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:24,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709847301] [2024-09-25 10:29:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709847301] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:29:24,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:29:24,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:29:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750446263] [2024-09-25 10:29:24,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:29:24,751 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:29:24,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:24,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:29:24,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:29:24,752 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:24,779 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2024-09-25 10:29:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:29:24,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-25 10:29:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:24,781 INFO L225 Difference]: With dead ends: 48 [2024-09-25 10:29:24,781 INFO L226 Difference]: Without dead ends: 36 [2024-09-25 10:29:24,781 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:29:24,782 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:24,782 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:29:24,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-25 10:29:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-09-25 10:29:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2024-09-25 10:29:24,789 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 17 [2024-09-25 10:29:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:24,789 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2024-09-25 10:29:24,789 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2024-09-25 10:29:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:29:24,790 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:24,790 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:24,790 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 10:29:24,790 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:24,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1567147830, now seen corresponding path program 1 times [2024-09-25 10:29:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:24,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494841466] [2024-09-25 10:29:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:24,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:24,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:24,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494841466] [2024-09-25 10:29:24,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494841466] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:29:24,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:29:24,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:29:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199930002] [2024-09-25 10:29:24,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:29:24,854 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:29:24,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:24,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:29:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:29:24,856 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:24,901 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2024-09-25 10:29:24,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:29:24,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-25 10:29:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:24,902 INFO L225 Difference]: With dead ends: 46 [2024-09-25 10:29:24,902 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 10:29:24,902 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:29:24,903 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:24,903 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:29:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 10:29:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-25 10:29:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2024-09-25 10:29:24,915 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 19 [2024-09-25 10:29:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:24,915 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2024-09-25 10:29:24,915 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:24,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2024-09-25 10:29:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:29:24,916 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:24,916 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:24,916 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:29:24,916 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:24,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:24,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1052281419, now seen corresponding path program 1 times [2024-09-25 10:29:24,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:24,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307181995] [2024-09-25 10:29:24,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:24,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:25,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:25,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:25,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307181995] [2024-09-25 10:29:25,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307181995] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057459379] [2024-09-25 10:29:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:25,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:25,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:25,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:25,027 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:29:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:25,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 10:29:25,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:25,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:25,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057459379] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:25,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:29:25,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 8 [2024-09-25 10:29:25,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783979425] [2024-09-25 10:29:25,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:29:25,155 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:29:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:25,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:29:25,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:29:25,156 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:25,196 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2024-09-25 10:29:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:29:25,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-09-25 10:29:25,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:25,197 INFO L225 Difference]: With dead ends: 40 [2024-09-25 10:29:25,197 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 10:29:25,197 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:29:25,198 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:25,198 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 40 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:29:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 10:29:25,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-25 10:29:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-09-25 10:29:25,202 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2024-09-25 10:29:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:25,202 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-09-25 10:29:25,202 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:25,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-09-25 10:29:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:29:25,203 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:25,203 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:25,220 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:29:25,407 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:29:25,408 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:25,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash -61419458, now seen corresponding path program 1 times [2024-09-25 10:29:25,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:25,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026377016] [2024-09-25 10:29:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:25,481 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:29:25,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:25,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026377016] [2024-09-25 10:29:25,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026377016] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:25,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206636919] [2024-09-25 10:29:25,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:25,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:25,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:25,486 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:25,487 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:29:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:25,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:29:25,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:29:25,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:29:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206636919] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:25,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 5] total 10 [2024-09-25 10:29:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922728791] [2024-09-25 10:29:25,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:25,615 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:29:25,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:25,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:29:25,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:29:25,616 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:25,759 INFO L93 Difference]: Finished difference Result 95 states and 148 transitions. [2024-09-25 10:29:25,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:29:25,760 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-25 10:29:25,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:25,763 INFO L225 Difference]: With dead ends: 95 [2024-09-25 10:29:25,763 INFO L226 Difference]: Without dead ends: 77 [2024-09-25 10:29:25,764 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:29:25,765 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:25,766 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 76 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:29:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-25 10:29:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2024-09-25 10:29:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 52 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2024-09-25 10:29:25,784 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 20 [2024-09-25 10:29:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:25,784 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2024-09-25 10:29:25,784 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:25,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:25,784 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2024-09-25 10:29:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:29:25,785 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:25,785 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:25,799 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:29:25,986 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:29:25,987 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:25,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:25,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1324513826, now seen corresponding path program 1 times [2024-09-25 10:29:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:25,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54115431] [2024-09-25 10:29:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:26,057 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:26,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54115431] [2024-09-25 10:29:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54115431] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:26,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658520407] [2024-09-25 10:29:26,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:26,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:26,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:26,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:26,063 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:29:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:26,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 10:29:26,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:26,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:29:26,133 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:29:26,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658520407] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:26,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:26,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-09-25 10:29:26,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791703705] [2024-09-25 10:29:26,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:26,153 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:29:26,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:26,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:29:26,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:29:26,154 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:26,252 INFO L93 Difference]: Finished difference Result 174 states and 264 transitions. [2024-09-25 10:29:26,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:29:26,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-25 10:29:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:26,254 INFO L225 Difference]: With dead ends: 174 [2024-09-25 10:29:26,254 INFO L226 Difference]: Without dead ends: 150 [2024-09-25 10:29:26,255 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:29:26,255 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:26,255 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 83 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:29:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-09-25 10:29:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 87. [2024-09-25 10:29:26,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.5) internal successors, (123), 82 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:26,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 127 transitions. [2024-09-25 10:29:26,289 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 127 transitions. Word has length 20 [2024-09-25 10:29:26,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:26,289 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 127 transitions. [2024-09-25 10:29:26,289 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:26,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 127 transitions. [2024-09-25 10:29:26,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:29:26,290 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:26,290 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:26,314 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:29:26,495 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 10:29:26,496 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:26,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:26,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1423642650, now seen corresponding path program 1 times [2024-09-25 10:29:26,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:26,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711354362] [2024-09-25 10:29:26,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:26,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:26,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:26,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:26,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711354362] [2024-09-25 10:29:26,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711354362] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:26,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382891457] [2024-09-25 10:29:26,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:26,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:26,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:26,574 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:26,576 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:29:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:26,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 10:29:26,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:26,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:26,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:26,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382891457] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:26,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:26,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-09-25 10:29:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446530991] [2024-09-25 10:29:26,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:26,686 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:29:26,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:26,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:29:26,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:29:26,687 INFO L87 Difference]: Start difference. First operand 87 states and 127 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:26,924 INFO L93 Difference]: Finished difference Result 162 states and 239 transitions. [2024-09-25 10:29:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 10:29:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:29:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:26,926 INFO L225 Difference]: With dead ends: 162 [2024-09-25 10:29:26,926 INFO L226 Difference]: Without dead ends: 127 [2024-09-25 10:29:26,926 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:29:26,926 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:26,927 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 77 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:29:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-09-25 10:29:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2024-09-25 10:29:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 101 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 150 transitions. [2024-09-25 10:29:26,958 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 150 transitions. Word has length 21 [2024-09-25 10:29:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:26,958 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 150 transitions. [2024-09-25 10:29:26,959 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:26,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 150 transitions. [2024-09-25 10:29:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:29:26,961 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:26,961 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:26,975 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:29:27,161 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:27,162 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:27,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:27,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1756794400, now seen corresponding path program 1 times [2024-09-25 10:29:27,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:27,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520330925] [2024-09-25 10:29:27,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:27,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:27,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:27,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:27,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520330925] [2024-09-25 10:29:27,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520330925] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:27,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191894558] [2024-09-25 10:29:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:27,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:27,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:27,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:27,305 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:29:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:27,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 10:29:27,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:29:27,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:29:27,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191894558] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:27,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:27,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-09-25 10:29:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311049358] [2024-09-25 10:29:27,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:27,417 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:29:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:27,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:29:27,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:29:27,418 INFO L87 Difference]: Start difference. First operand 106 states and 150 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:27,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:27,488 INFO L93 Difference]: Finished difference Result 136 states and 193 transitions. [2024-09-25 10:29:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:29:27,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-25 10:29:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:27,490 INFO L225 Difference]: With dead ends: 136 [2024-09-25 10:29:27,490 INFO L226 Difference]: Without dead ends: 120 [2024-09-25 10:29:27,490 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:29:27,490 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:27,491 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 94 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:29:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-25 10:29:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2024-09-25 10:29:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 97 states have internal predecessors, (145), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-09-25 10:29:27,518 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 22 [2024-09-25 10:29:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:27,518 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-09-25 10:29:27,518 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:27,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-09-25 10:29:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 10:29:27,519 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:27,519 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:27,533 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:29:27,719 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 10:29:27,720 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:27,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash 731418570, now seen corresponding path program 2 times [2024-09-25 10:29:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:27,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990130164] [2024-09-25 10:29:27,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:27,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 10:29:27,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:27,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990130164] [2024-09-25 10:29:27,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990130164] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:27,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139332090] [2024-09-25 10:29:27,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:29:27,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:27,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:27,798 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-25 10:29:27,799 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-25 10:29:27,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:29:27,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:27,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 10:29:27,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 10:29:27,862 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 10:29:27,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139332090] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:27,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:27,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 13 [2024-09-25 10:29:27,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081441045] [2024-09-25 10:29:27,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:27,927 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:29:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:27,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:29:27,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:29:27,927 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:28,051 INFO L93 Difference]: Finished difference Result 143 states and 210 transitions. [2024-09-25 10:29:28,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 10:29:28,051 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-09-25 10:29:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:28,052 INFO L225 Difference]: With dead ends: 143 [2024-09-25 10:29:28,052 INFO L226 Difference]: Without dead ends: 97 [2024-09-25 10:29:28,052 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:29:28,052 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:28,053 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 111 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:29:28,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-25 10:29:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2024-09-25 10:29:28,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 84 states have internal predecessors, (124), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-09-25 10:29:28,070 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 23 [2024-09-25 10:29:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:28,071 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-09-25 10:29:28,071 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:28,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-09-25 10:29:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 10:29:28,072 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:28,072 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:28,085 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:29:28,273 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 10:29:28,273 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:28,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1260027713, now seen corresponding path program 3 times [2024-09-25 10:29:28,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:28,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036928579] [2024-09-25 10:29:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:28,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:28,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:28,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:28,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036928579] [2024-09-25 10:29:28,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036928579] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:28,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996148786] [2024-09-25 10:29:28,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:29:28,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:28,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:28,364 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:28,365 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:29:28,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-25 10:29:28,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:28,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:29:28,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:29:28,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:29:28,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996148786] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:28,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:28,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2024-09-25 10:29:28,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852115134] [2024-09-25 10:29:28,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:28,568 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 10:29:28,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:28,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 10:29:28,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:29:28,568 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:28,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:28,884 INFO L93 Difference]: Finished difference Result 146 states and 212 transitions. [2024-09-25 10:29:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 10:29:28,884 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-09-25 10:29:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:28,885 INFO L225 Difference]: With dead ends: 146 [2024-09-25 10:29:28,885 INFO L226 Difference]: Without dead ends: 89 [2024-09-25 10:29:28,886 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:29:28,886 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:28,887 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 192 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:29:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-25 10:29:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2024-09-25 10:29:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-09-25 10:29:28,907 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 24 [2024-09-25 10:29:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:28,908 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-09-25 10:29:28,908 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:28,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:28,908 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-09-25 10:29:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 10:29:28,910 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:28,910 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:28,926 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 10:29:29,111 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:29,111 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:29,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2144926014, now seen corresponding path program 4 times [2024-09-25 10:29:29,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:29,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794416636] [2024-09-25 10:29:29,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:29,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:29,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:29:29,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:29,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794416636] [2024-09-25 10:29:29,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794416636] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:29,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131902051] [2024-09-25 10:29:29,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:29:29,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:29,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:29,197 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:29,198 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:29:29,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:29:29,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:29,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-25 10:29:29,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:29:29,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 10:29:29,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131902051] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:29,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:29,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 5] total 13 [2024-09-25 10:29:29,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108613252] [2024-09-25 10:29:29,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:29,322 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:29:29,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:29,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:29:29,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:29:29,322 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:29,671 INFO L93 Difference]: Finished difference Result 175 states and 263 transitions. [2024-09-25 10:29:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-25 10:29:29,672 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-09-25 10:29:29,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:29,672 INFO L225 Difference]: With dead ends: 175 [2024-09-25 10:29:29,672 INFO L226 Difference]: Without dead ends: 140 [2024-09-25 10:29:29,673 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2024-09-25 10:29:29,673 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 25 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:29,673 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 180 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:29:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-25 10:29:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2024-09-25 10:29:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 102 states have internal predecessors, (147), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 151 transitions. [2024-09-25 10:29:29,700 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 151 transitions. Word has length 26 [2024-09-25 10:29:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:29,700 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 151 transitions. [2024-09-25 10:29:29,700 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:29,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 151 transitions. [2024-09-25 10:29:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 10:29:29,702 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:29,702 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:29,714 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 10:29:29,906 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:29,907 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:29,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash -52963974, now seen corresponding path program 5 times [2024-09-25 10:29:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:29,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506708701] [2024-09-25 10:29:29,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:29,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:30,024 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:30,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:30,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506708701] [2024-09-25 10:29:30,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506708701] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:30,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140364984] [2024-09-25 10:29:30,027 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:29:30,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:30,030 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:30,031 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 10:29:30,076 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-09-25 10:29:30,076 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:30,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 10:29:30,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:29:30,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 10:29:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140364984] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:30,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:30,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 22 [2024-09-25 10:29:30,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109890520] [2024-09-25 10:29:30,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:30,269 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-25 10:29:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:30,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-25 10:29:30,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:29:30,270 INFO L87 Difference]: Start difference. First operand 107 states and 151 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:30,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:30,781 INFO L93 Difference]: Finished difference Result 183 states and 271 transitions. [2024-09-25 10:29:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-25 10:29:30,782 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-09-25 10:29:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:30,783 INFO L225 Difference]: With dead ends: 183 [2024-09-25 10:29:30,783 INFO L226 Difference]: Without dead ends: 146 [2024-09-25 10:29:30,783 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=420, Invalid=1140, Unknown=0, NotChecked=0, Total=1560 [2024-09-25 10:29:30,784 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:30,784 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 199 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:29:30,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-09-25 10:29:30,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2024-09-25 10:29:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 111 states have internal predecessors, (153), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2024-09-25 10:29:30,812 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 27 [2024-09-25 10:29:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:30,813 INFO L474 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2024-09-25 10:29:30,813 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:30,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2024-09-25 10:29:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 10:29:30,814 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:30,814 INFO L216 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:30,828 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 10:29:31,018 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-25 10:29:31,019 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:31,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1202238023, now seen corresponding path program 1 times [2024-09-25 10:29:31,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:31,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356316793] [2024-09-25 10:29:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:31,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:31,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:31,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:29:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:31,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356316793] [2024-09-25 10:29:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356316793] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992495847] [2024-09-25 10:29:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:31,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:31,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:31,117 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:31,119 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 10:29:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:31,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-25 10:29:31,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:29:31,215 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-25 10:29:31,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992495847] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:31,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:31,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 8] total 20 [2024-09-25 10:29:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723034391] [2024-09-25 10:29:31,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:31,320 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 10:29:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 10:29:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2024-09-25 10:29:31,323 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:31,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:31,875 INFO L93 Difference]: Finished difference Result 223 states and 327 transitions. [2024-09-25 10:29:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-25 10:29:31,875 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-09-25 10:29:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:31,876 INFO L225 Difference]: With dead ends: 223 [2024-09-25 10:29:31,876 INFO L226 Difference]: Without dead ends: 173 [2024-09-25 10:29:31,877 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=317, Invalid=1323, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 10:29:31,877 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 34 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:31,878 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 214 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:29:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-09-25 10:29:31,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 142. [2024-09-25 10:29:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.3941605839416058) internal successors, (191), 137 states have internal predecessors, (191), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 195 transitions. [2024-09-25 10:29:31,898 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 195 transitions. Word has length 27 [2024-09-25 10:29:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:31,898 INFO L474 AbstractCegarLoop]: Abstraction has 142 states and 195 transitions. [2024-09-25 10:29:31,898 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:31,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 195 transitions. [2024-09-25 10:29:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 10:29:31,899 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:31,899 INFO L216 NwaCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:31,911 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-25 10:29:32,103 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-25 10:29:32,104 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:32,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1489538522, now seen corresponding path program 2 times [2024-09-25 10:29:32,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:32,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703826178] [2024-09-25 10:29:32,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:32,196 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:29:32,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:32,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703826178] [2024-09-25 10:29:32,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703826178] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:32,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209450322] [2024-09-25 10:29:32,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:29:32,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:32,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:32,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:32,202 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 10:29:32,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:29:32,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:32,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-25 10:29:32,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:29:32,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:29:32,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209450322] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:32,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:32,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 7] total 18 [2024-09-25 10:29:32,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25114024] [2024-09-25 10:29:32,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:32,372 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 10:29:32,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:32,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 10:29:32,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:29:32,373 INFO L87 Difference]: Start difference. First operand 142 states and 195 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:32,590 INFO L93 Difference]: Finished difference Result 333 states and 496 transitions. [2024-09-25 10:29:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 10:29:32,591 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-09-25 10:29:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:32,592 INFO L225 Difference]: With dead ends: 333 [2024-09-25 10:29:32,592 INFO L226 Difference]: Without dead ends: 265 [2024-09-25 10:29:32,593 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:29:32,594 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 65 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:32,594 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 230 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:29:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-09-25 10:29:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 193. [2024-09-25 10:29:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 188 states have (on average 1.372340425531915) internal successors, (258), 188 states have internal predecessors, (258), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 262 transitions. [2024-09-25 10:29:32,624 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 262 transitions. Word has length 27 [2024-09-25 10:29:32,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:32,624 INFO L474 AbstractCegarLoop]: Abstraction has 193 states and 262 transitions. [2024-09-25 10:29:32,625 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:32,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 262 transitions. [2024-09-25 10:29:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 10:29:32,625 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:32,625 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:32,637 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-25 10:29:32,829 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-25 10:29:32,829 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:32,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:32,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2067363207, now seen corresponding path program 2 times [2024-09-25 10:29:32,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:32,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073030332] [2024-09-25 10:29:32,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:32,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:32,978 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:29:32,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:32,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073030332] [2024-09-25 10:29:32,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073030332] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:32,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040486627] [2024-09-25 10:29:32,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:29:32,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:32,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:32,982 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:32,984 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-25 10:29:33,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:29:33,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:33,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 10:29:33,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-25 10:29:33,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-25 10:29:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040486627] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:33,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:33,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 23 [2024-09-25 10:29:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762642605] [2024-09-25 10:29:33,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:33,162 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-25 10:29:33,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-25 10:29:33,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-09-25 10:29:33,162 INFO L87 Difference]: Start difference. First operand 193 states and 262 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:33,948 INFO L93 Difference]: Finished difference Result 431 states and 663 transitions. [2024-09-25 10:29:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-25 10:29:33,948 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-09-25 10:29:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:33,950 INFO L225 Difference]: With dead ends: 431 [2024-09-25 10:29:33,951 INFO L226 Difference]: Without dead ends: 374 [2024-09-25 10:29:33,951 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=655, Invalid=2537, Unknown=0, NotChecked=0, Total=3192 [2024-09-25 10:29:33,952 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 123 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:33,952 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 271 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:29:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-09-25 10:29:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 266. [2024-09-25 10:29:34,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.3754789272030652) internal successors, (359), 261 states have internal predecessors, (359), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 363 transitions. [2024-09-25 10:29:34,006 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 363 transitions. Word has length 29 [2024-09-25 10:29:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:34,006 INFO L474 AbstractCegarLoop]: Abstraction has 266 states and 363 transitions. [2024-09-25 10:29:34,006 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:34,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 363 transitions. [2024-09-25 10:29:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 10:29:34,007 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:34,007 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:34,020 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-25 10:29:34,212 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-25 10:29:34,212 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:34,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:34,212 INFO L85 PathProgramCache]: Analyzing trace with hash 997958656, now seen corresponding path program 3 times [2024-09-25 10:29:34,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:34,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976863505] [2024-09-25 10:29:34,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:34,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-25 10:29:34,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:34,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976863505] [2024-09-25 10:29:34,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976863505] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:34,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061476599] [2024-09-25 10:29:34,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:29:34,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:34,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:34,337 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:34,338 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-25 10:29:34,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 10:29:34,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:34,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:29:34,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-25 10:29:34,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-25 10:29:34,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061476599] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:34,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:34,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 16 [2024-09-25 10:29:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936662479] [2024-09-25 10:29:34,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:34,494 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 10:29:34,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:34,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 10:29:34,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:29:34,495 INFO L87 Difference]: Start difference. First operand 266 states and 363 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:42,551 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:29:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:50,946 INFO L93 Difference]: Finished difference Result 792 states and 1162 transitions. [2024-09-25 10:29:50,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-25 10:29:50,946 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-09-25 10:29:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:50,950 INFO L225 Difference]: With dead ends: 792 [2024-09-25 10:29:50,950 INFO L226 Difference]: Without dead ends: 689 [2024-09-25 10:29:50,951 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:29:50,952 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 94 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:50,952 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 205 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:29:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-09-25 10:29:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 333. [2024-09-25 10:29:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 328 states have (on average 1.375) internal successors, (451), 328 states have internal predecessors, (451), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 455 transitions. [2024-09-25 10:29:51,037 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 455 transitions. Word has length 30 [2024-09-25 10:29:51,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:51,037 INFO L474 AbstractCegarLoop]: Abstraction has 333 states and 455 transitions. [2024-09-25 10:29:51,037 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:51,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:51,037 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 455 transitions. [2024-09-25 10:29:51,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 10:29:51,038 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:51,038 INFO L216 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:51,051 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-09-25 10:29:51,242 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-25 10:29:51,242 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:51,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:51,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1400929057, now seen corresponding path program 2 times [2024-09-25 10:29:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343022314] [2024-09-25 10:29:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:51,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:29:51,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:51,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343022314] [2024-09-25 10:29:51,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343022314] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:51,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513875866] [2024-09-25 10:29:51,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:29:51,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:51,373 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:51,373 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-09-25 10:29:51,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:29:51,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:51,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 10:29:51,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:29:51,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-25 10:29:51,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513875866] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:51,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:51,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 5] total 15 [2024-09-25 10:29:51,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400321980] [2024-09-25 10:29:51,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:51,504 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 10:29:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:51,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 10:29:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:29:51,505 INFO L87 Difference]: Start difference. First operand 333 states and 455 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:51,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:51,926 INFO L93 Difference]: Finished difference Result 710 states and 1014 transitions. [2024-09-25 10:29:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 10:29:51,926 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-09-25 10:29:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:51,929 INFO L225 Difference]: With dead ends: 710 [2024-09-25 10:29:51,929 INFO L226 Difference]: Without dead ends: 571 [2024-09-25 10:29:51,929 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:29:51,929 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 101 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:51,930 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 299 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:29:51,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-09-25 10:29:52,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 427. [2024-09-25 10:29:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 422 states have (on average 1.3578199052132702) internal successors, (573), 422 states have internal predecessors, (573), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 577 transitions. [2024-09-25 10:29:52,027 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 577 transitions. Word has length 30 [2024-09-25 10:29:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:52,031 INFO L474 AbstractCegarLoop]: Abstraction has 427 states and 577 transitions. [2024-09-25 10:29:52,031 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:52,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 577 transitions. [2024-09-25 10:29:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 10:29:52,032 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:52,032 INFO L216 NwaCegarLoop]: trace histogram [7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:52,045 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-09-25 10:29:52,236 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:52,237 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:52,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:52,237 INFO L85 PathProgramCache]: Analyzing trace with hash -184327170, now seen corresponding path program 4 times [2024-09-25 10:29:52,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:52,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273942788] [2024-09-25 10:29:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:52,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:52,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 10:29:52,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:52,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273942788] [2024-09-25 10:29:52,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273942788] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:52,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058061759] [2024-09-25 10:29:52,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:29:52,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:52,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:52,367 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:52,368 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-09-25 10:29:52,404 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:29:52,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:52,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-25 10:29:52,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 10:29:52,428 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:52,479 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-25 10:29:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058061759] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:52,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:52,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 5] total 16 [2024-09-25 10:29:52,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557234663] [2024-09-25 10:29:52,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:52,480 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 10:29:52,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:52,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 10:29:52,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:29:52,481 INFO L87 Difference]: Start difference. First operand 427 states and 577 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:53,026 INFO L93 Difference]: Finished difference Result 849 states and 1195 transitions. [2024-09-25 10:29:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-25 10:29:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-09-25 10:29:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:53,029 INFO L225 Difference]: With dead ends: 849 [2024-09-25 10:29:53,029 INFO L226 Difference]: Without dead ends: 667 [2024-09-25 10:29:53,030 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2024-09-25 10:29:53,031 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 131 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:53,031 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 389 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:29:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-09-25 10:29:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 425. [2024-09-25 10:29:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 1.3714285714285714) internal successors, (576), 420 states have internal predecessors, (576), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 580 transitions. [2024-09-25 10:29:53,141 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 580 transitions. Word has length 32 [2024-09-25 10:29:53,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:53,141 INFO L474 AbstractCegarLoop]: Abstraction has 425 states and 580 transitions. [2024-09-25 10:29:53,141 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:53,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 580 transitions. [2024-09-25 10:29:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 10:29:53,142 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:53,142 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:53,155 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-09-25 10:29:53,346 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:53,347 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:53,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash -906855808, now seen corresponding path program 5 times [2024-09-25 10:29:53,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:53,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566173561] [2024-09-25 10:29:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:53,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:29:53,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566173561] [2024-09-25 10:29:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566173561] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:53,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302459543] [2024-09-25 10:29:53,535 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:29:53,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:53,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:53,536 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:53,537 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-09-25 10:29:53,586 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-09-25 10:29:53,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:53,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-25 10:29:53,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:29:53,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:29:53,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302459543] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:53,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:53,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2024-09-25 10:29:53,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63762774] [2024-09-25 10:29:53,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:53,680 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 10:29:53,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:53,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 10:29:53,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:29:53,680 INFO L87 Difference]: Start difference. First operand 425 states and 580 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:53,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:53,902 INFO L93 Difference]: Finished difference Result 519 states and 698 transitions. [2024-09-25 10:29:53,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:29:53,903 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-09-25 10:29:53,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:53,905 INFO L225 Difference]: With dead ends: 519 [2024-09-25 10:29:53,905 INFO L226 Difference]: Without dead ends: 493 [2024-09-25 10:29:53,905 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 10 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:29:53,905 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:53,905 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 158 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:29:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-09-25 10:29:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 429. [2024-09-25 10:29:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 424 states have (on average 1.3797169811320755) internal successors, (585), 424 states have internal predecessors, (585), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 589 transitions. [2024-09-25 10:29:54,011 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 589 transitions. Word has length 34 [2024-09-25 10:29:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:54,011 INFO L474 AbstractCegarLoop]: Abstraction has 429 states and 589 transitions. [2024-09-25 10:29:54,011 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:54,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 589 transitions. [2024-09-25 10:29:54,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-25 10:29:54,012 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:54,012 INFO L216 NwaCegarLoop]: trace histogram [8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:54,025 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-09-25 10:29:54,216 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:54,217 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:54,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:54,217 INFO L85 PathProgramCache]: Analyzing trace with hash 452281887, now seen corresponding path program 3 times [2024-09-25 10:29:54,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:54,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575766097] [2024-09-25 10:29:54,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:54,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:54,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:29:54,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:54,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575766097] [2024-09-25 10:29:54,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575766097] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:54,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89589270] [2024-09-25 10:29:54,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:29:54,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:54,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:54,380 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:54,381 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-09-25 10:29:54,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 10:29:54,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:54,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-25 10:29:54,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-09-25 10:29:54,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-09-25 10:29:54,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89589270] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:54,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:54,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 10] total 28 [2024-09-25 10:29:54,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887972043] [2024-09-25 10:29:54,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:54,763 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-25 10:29:54,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:54,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-25 10:29:54,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2024-09-25 10:29:54,764 INFO L87 Difference]: Start difference. First operand 429 states and 589 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:56,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:56,682 INFO L93 Difference]: Finished difference Result 916 states and 1289 transitions. [2024-09-25 10:29:56,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-09-25 10:29:56,684 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-09-25 10:29:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:56,686 INFO L225 Difference]: With dead ends: 916 [2024-09-25 10:29:56,686 INFO L226 Difference]: Without dead ends: 581 [2024-09-25 10:29:56,688 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1580 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=940, Invalid=5702, Unknown=0, NotChecked=0, Total=6642 [2024-09-25 10:29:56,688 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 213 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 2133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:56,688 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 608 Invalid, 2133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-25 10:29:56,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-09-25 10:29:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 445. [2024-09-25 10:29:56,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 440 states have (on average 1.3590909090909091) internal successors, (598), 440 states have internal predecessors, (598), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 602 transitions. [2024-09-25 10:29:56,814 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 602 transitions. Word has length 34 [2024-09-25 10:29:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:56,814 INFO L474 AbstractCegarLoop]: Abstraction has 445 states and 602 transitions. [2024-09-25 10:29:56,814 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:56,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:56,814 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 602 transitions. [2024-09-25 10:29:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 10:29:56,815 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:56,815 INFO L216 NwaCegarLoop]: trace histogram [9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:56,827 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-09-25 10:29:57,015 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:57,015 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:57,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2108590391, now seen corresponding path program 4 times [2024-09-25 10:29:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:57,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015285084] [2024-09-25 10:29:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:57,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-25 10:29:57,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015285084] [2024-09-25 10:29:57,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015285084] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469363651] [2024-09-25 10:29:57,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:29:57,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:57,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:57,188 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:57,189 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-09-25 10:29:57,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:29:57,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:57,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-25 10:29:57,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 10:29:57,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-25 10:29:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469363651] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:57,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 6] total 20 [2024-09-25 10:29:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005015039] [2024-09-25 10:29:57,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:57,332 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 10:29:57,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:57,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 10:29:57,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-09-25 10:29:57,333 INFO L87 Difference]: Start difference. First operand 445 states and 602 transitions. Second operand has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:29:57,991 INFO L93 Difference]: Finished difference Result 918 states and 1325 transitions. [2024-09-25 10:29:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-25 10:29:57,992 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-09-25 10:29:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:29:57,994 INFO L225 Difference]: With dead ends: 918 [2024-09-25 10:29:57,994 INFO L226 Difference]: Without dead ends: 780 [2024-09-25 10:29:57,995 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 10:29:57,995 INFO L434 NwaCegarLoop]: 53 mSDtfsCounter, 154 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:29:57,996 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 535 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:29:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-09-25 10:29:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 534. [2024-09-25 10:29:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 529 states have (on average 1.3761814744801513) internal successors, (728), 529 states have internal predecessors, (728), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 732 transitions. [2024-09-25 10:29:58,181 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 732 transitions. Word has length 37 [2024-09-25 10:29:58,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:29:58,181 INFO L474 AbstractCegarLoop]: Abstraction has 534 states and 732 transitions. [2024-09-25 10:29:58,181 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.9) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:29:58,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 732 transitions. [2024-09-25 10:29:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 10:29:58,183 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:29:58,183 INFO L216 NwaCegarLoop]: trace histogram [10, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:29:58,195 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-09-25 10:29:58,383 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-09-25 10:29:58,383 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:29:58,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:29:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1423913430, now seen corresponding path program 6 times [2024-09-25 10:29:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:29:58,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160026946] [2024-09-25 10:29:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:29:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:29:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:58,553 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:29:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:29:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 10:29:58,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:29:58,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160026946] [2024-09-25 10:29:58,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160026946] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:29:58,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938675769] [2024-09-25 10:29:58,555 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:29:58,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:29:58,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:29:58,559 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:29:58,561 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-09-25 10:29:58,622 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-09-25 10:29:58,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:29:58,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-25 10:29:58,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:29:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-25 10:29:58,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:29:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-09-25 10:29:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938675769] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:29:58,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:29:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 11] total 30 [2024-09-25 10:29:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188168205] [2024-09-25 10:29:58,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:29:58,978 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-25 10:29:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:29:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-25 10:29:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2024-09-25 10:29:58,979 INFO L87 Difference]: Start difference. First operand 534 states and 732 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:01,078 INFO L93 Difference]: Finished difference Result 1030 states and 1483 transitions. [2024-09-25 10:30:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-09-25 10:30:01,079 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-09-25 10:30:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:01,081 INFO L225 Difference]: With dead ends: 1030 [2024-09-25 10:30:01,082 INFO L226 Difference]: Without dead ends: 709 [2024-09-25 10:30:01,083 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=802, Invalid=7570, Unknown=0, NotChecked=0, Total=8372 [2024-09-25 10:30:01,084 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 133 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:01,084 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 820 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-25 10:30:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-09-25 10:30:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 529. [2024-09-25 10:30:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 524 states have (on average 1.3587786259541985) internal successors, (712), 524 states have internal predecessors, (712), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 716 transitions. [2024-09-25 10:30:01,233 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 716 transitions. Word has length 37 [2024-09-25 10:30:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:01,233 INFO L474 AbstractCegarLoop]: Abstraction has 529 states and 716 transitions. [2024-09-25 10:30:01,233 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:01,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 716 transitions. [2024-09-25 10:30:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-25 10:30:01,234 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:01,234 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:01,249 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-09-25 10:30:01,438 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-09-25 10:30:01,438 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:01,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:01,439 INFO L85 PathProgramCache]: Analyzing trace with hash 52817055, now seen corresponding path program 7 times [2024-09-25 10:30:01,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:01,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186591546] [2024-09-25 10:30:01,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:01,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,559 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-09-25 10:30:01,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:01,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186591546] [2024-09-25 10:30:01,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186591546] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:01,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831891841] [2024-09-25 10:30:01,560 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:30:01,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:01,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:01,561 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:01,562 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-09-25 10:30:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 10:30:01,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-09-25 10:30:01,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-09-25 10:30:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831891841] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:01,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:01,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-09-25 10:30:01,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190183996] [2024-09-25 10:30:01,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:01,695 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:30:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:01,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:30:01,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:30:01,696 INFO L87 Difference]: Start difference. First operand 529 states and 716 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:02,225 INFO L93 Difference]: Finished difference Result 823 states and 1090 transitions. [2024-09-25 10:30:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 10:30:02,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-09-25 10:30:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:02,229 INFO L225 Difference]: With dead ends: 823 [2024-09-25 10:30:02,229 INFO L226 Difference]: Without dead ends: 785 [2024-09-25 10:30:02,229 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 72 SyntacticMatches, 10 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:30:02,229 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 19 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:02,230 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 175 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:30:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-09-25 10:30:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 555. [2024-09-25 10:30:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 550 states have (on average 1.3545454545454545) internal successors, (745), 550 states have internal predecessors, (745), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 749 transitions. [2024-09-25 10:30:02,416 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 749 transitions. Word has length 38 [2024-09-25 10:30:02,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:02,416 INFO L474 AbstractCegarLoop]: Abstraction has 555 states and 749 transitions. [2024-09-25 10:30:02,416 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:02,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 749 transitions. [2024-09-25 10:30:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-25 10:30:02,417 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:02,417 INFO L216 NwaCegarLoop]: trace histogram [8, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:02,430 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-09-25 10:30:02,618 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-09-25 10:30:02,618 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:02,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1717896673, now seen corresponding path program 3 times [2024-09-25 10:30:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:02,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399783356] [2024-09-25 10:30:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:02,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:02,792 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-25 10:30:02,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399783356] [2024-09-25 10:30:02,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399783356] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593061872] [2024-09-25 10:30:02,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:30:02,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:02,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:02,794 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:02,800 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-09-25 10:30:02,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 10:30:02,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:02,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 10:30:02,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-25 10:30:02,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-25 10:30:03,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593061872] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:03,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:03,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2024-09-25 10:30:03,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111466119] [2024-09-25 10:30:03,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:03,150 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-25 10:30:03,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:03,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-25 10:30:03,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2024-09-25 10:30:03,151 INFO L87 Difference]: Start difference. First operand 555 states and 749 transitions. Second operand has 30 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:05,142 INFO L93 Difference]: Finished difference Result 1179 states and 1672 transitions. [2024-09-25 10:30:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-09-25 10:30:05,142 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-09-25 10:30:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:05,146 INFO L225 Difference]: With dead ends: 1179 [2024-09-25 10:30:05,146 INFO L226 Difference]: Without dead ends: 1065 [2024-09-25 10:30:05,147 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1538, Invalid=5944, Unknown=0, NotChecked=0, Total=7482 [2024-09-25 10:30:05,147 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 290 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:05,148 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 387 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:30:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-09-25 10:30:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 659. [2024-09-25 10:30:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 654 states have (on average 1.3516819571865444) internal successors, (884), 654 states have internal predecessors, (884), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2024-09-25 10:30:05,413 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 38 [2024-09-25 10:30:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:05,413 INFO L474 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2024-09-25 10:30:05,413 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:05,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:05,414 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2024-09-25 10:30:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 10:30:05,415 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:05,415 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:05,426 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-09-25 10:30:05,617 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-09-25 10:30:05,617 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:05,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 171159391, now seen corresponding path program 8 times [2024-09-25 10:30:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:05,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316924784] [2024-09-25 10:30:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:05,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-25 10:30:05,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:05,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316924784] [2024-09-25 10:30:05,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316924784] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:05,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920918218] [2024-09-25 10:30:05,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:30:05,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:05,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:05,820 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:05,821 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-09-25 10:30:05,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:30:05,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:05,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-25 10:30:05,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:05,931 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-25 10:30:05,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-25 10:30:06,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920918218] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:06,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:06,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2024-09-25 10:30:06,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309419448] [2024-09-25 10:30:06,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:06,063 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:30:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:06,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:30:06,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:30:06,064 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:06,594 INFO L93 Difference]: Finished difference Result 952 states and 1240 transitions. [2024-09-25 10:30:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:30:06,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-09-25 10:30:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:06,597 INFO L225 Difference]: With dead ends: 952 [2024-09-25 10:30:06,598 INFO L226 Difference]: Without dead ends: 828 [2024-09-25 10:30:06,598 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 20 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:30:06,598 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:06,598 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 206 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:30:06,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-09-25 10:30:06,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 659. [2024-09-25 10:30:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 654 states have (on average 1.342507645259939) internal successors, (878), 654 states have internal predecessors, (878), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 882 transitions. [2024-09-25 10:30:06,869 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 882 transitions. Word has length 40 [2024-09-25 10:30:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:06,869 INFO L474 AbstractCegarLoop]: Abstraction has 659 states and 882 transitions. [2024-09-25 10:30:06,869 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:06,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:06,869 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 882 transitions. [2024-09-25 10:30:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 10:30:06,870 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:06,870 INFO L216 NwaCegarLoop]: trace histogram [11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:06,882 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-09-25 10:30:07,070 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-09-25 10:30:07,071 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:07,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash 520169312, now seen corresponding path program 9 times [2024-09-25 10:30:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:07,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367680607] [2024-09-25 10:30:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:07,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:07,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-25 10:30:07,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:07,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367680607] [2024-09-25 10:30:07,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367680607] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:07,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188178305] [2024-09-25 10:30:07,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:30:07,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:07,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:07,251 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:07,252 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-09-25 10:30:07,287 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 10:30:07,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:07,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-25 10:30:07,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-09-25 10:30:07,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-09-25 10:30:07,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188178305] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:07,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:07,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 22 [2024-09-25 10:30:07,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821378928] [2024-09-25 10:30:07,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:07,438 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-25 10:30:07,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:07,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-25 10:30:07,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-09-25 10:30:07,438 INFO L87 Difference]: Start difference. First operand 659 states and 882 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:08,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:08,443 INFO L93 Difference]: Finished difference Result 1366 states and 1918 transitions. [2024-09-25 10:30:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-09-25 10:30:08,443 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-09-25 10:30:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:08,447 INFO L225 Difference]: With dead ends: 1366 [2024-09-25 10:30:08,447 INFO L226 Difference]: Without dead ends: 1071 [2024-09-25 10:30:08,448 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 80 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=371, Invalid=1111, Unknown=0, NotChecked=0, Total=1482 [2024-09-25 10:30:08,448 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 288 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:08,448 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 764 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:30:08,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-09-25 10:30:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 683. [2024-09-25 10:30:08,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 678 states have (on average 1.345132743362832) internal successors, (912), 678 states have internal predecessors, (912), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:08,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 916 transitions. [2024-09-25 10:30:08,791 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 916 transitions. Word has length 40 [2024-09-25 10:30:08,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:08,792 INFO L474 AbstractCegarLoop]: Abstraction has 683 states and 916 transitions. [2024-09-25 10:30:08,792 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:08,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 916 transitions. [2024-09-25 10:30:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-25 10:30:08,793 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:08,793 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:08,805 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-09-25 10:30:08,993 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-09-25 10:30:08,994 INFO L399 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:08,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash -245472181, now seen corresponding path program 4 times [2024-09-25 10:30:08,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:08,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175895093] [2024-09-25 10:30:08,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:08,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:09,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-25 10:30:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:09,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175895093] [2024-09-25 10:30:09,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175895093] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:09,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618546556] [2024-09-25 10:30:09,185 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:30:09,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:09,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:09,187 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:09,188 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-09-25 10:30:09,230 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:30:09,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:09,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 10:30:09,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-25 10:30:09,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-25 10:30:09,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618546556] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:09,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:09,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 36 [2024-09-25 10:30:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791772508] [2024-09-25 10:30:09,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:09,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-25 10:30:09,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:09,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-25 10:30:09,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2024-09-25 10:30:09,609 INFO L87 Difference]: Start difference. First operand 683 states and 916 transitions. Second operand has 36 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:44,038 INFO L93 Difference]: Finished difference Result 1819 states and 2541 transitions. [2024-09-25 10:30:44,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 528 states. [2024-09-25 10:30:44,038 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2024-09-25 10:30:44,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:44,043 INFO L225 Difference]: With dead ends: 1819 [2024-09-25 10:30:44,043 INFO L226 Difference]: Without dead ends: 1490 [2024-09-25 10:30:44,057 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 527 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132299 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=34017, Invalid=245295, Unknown=0, NotChecked=0, Total=279312 [2024-09-25 10:30:44,057 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 1728 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 1568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1728 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 4121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1568 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:44,057 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1728 Valid, 628 Invalid, 4121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1568 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-09-25 10:30:44,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2024-09-25 10:30:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 778. [2024-09-25 10:30:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 773 states have (on average 1.3570504527813714) internal successors, (1049), 773 states have internal predecessors, (1049), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1053 transitions. [2024-09-25 10:30:44,623 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1053 transitions. Word has length 41 [2024-09-25 10:30:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:44,623 INFO L474 AbstractCegarLoop]: Abstraction has 778 states and 1053 transitions. [2024-09-25 10:30:44,624 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:44,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:44,624 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1053 transitions. [2024-09-25 10:30:44,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-25 10:30:44,625 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:44,625 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:44,637 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-09-25 10:30:44,825 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-09-25 10:30:44,825 INFO L399 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:44,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1706754144, now seen corresponding path program 10 times [2024-09-25 10:30:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255000327] [2024-09-25 10:30:44,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:45,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:45,067 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:30:45,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:45,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255000327] [2024-09-25 10:30:45,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255000327] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:45,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393552102] [2024-09-25 10:30:45,068 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:30:45,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:45,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:45,069 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:45,070 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-09-25 10:30:45,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:30:45,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:45,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-25 10:30:45,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-09-25 10:30:45,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-09-25 10:30:45,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393552102] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:45,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:45,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 24 [2024-09-25 10:30:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519637648] [2024-09-25 10:30:45,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:45,313 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 10:30:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 10:30:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:30:45,314 INFO L87 Difference]: Start difference. First operand 778 states and 1053 transitions. Second operand has 24 states, 24 states have (on average 2.375) internal successors, (57), 24 states have internal predecessors, (57), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:00,184 WARN L293 SmtUtils]: Spent 14.79s on a formula simplification. DAG size of input: 26 DAG size of output: 22 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:31:16,245 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:31:26,478 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:31:54,686 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:32:02,766 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:32:18,723 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:32:36,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:32:40,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:32:45,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:32:49,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-25 10:33:33,368 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:33:37,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []