./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/phases_1-1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/phases_1-1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bc900b1bfcaecf91bc89637deaef4e1ddf2476faf43fa7e6f1e197c315ae3982 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:21:14,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:21:14,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:21:15,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:21:15,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:21:15,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:21:15,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:21:15,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:21:15,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:21:15,034 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:21:15,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:21:15,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:21:15,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:21:15,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:21:15,035 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:21:15,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:21:15,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:21:15,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:21:15,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:21:15,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:21:15,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:21:15,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:21:15,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:21:15,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:21:15,039 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:21:15,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:21:15,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:21:15,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:21:15,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:21:15,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:21:15,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:21:15,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:21:15,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:21:15,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:21:15,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:21:15,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:21:15,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:21:15,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:21:15,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:21:15,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:21:15,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:21:15,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:21:15,044 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 -> bc900b1bfcaecf91bc89637deaef4e1ddf2476faf43fa7e6f1e197c315ae3982 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 15:21:15,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:21:15,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:21:15,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:21:15,326 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:21:15,327 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:21:15,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-acceleration/phases_1-1.c [2024-09-12 15:21:16,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:21:16,795 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:21:16,795 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/phases_1-1.c [2024-09-12 15:21:16,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4cf932a4c/fd1b73ed3395420c8378f653269a044f/FLAGc7763f925 [2024-09-12 15:21:16,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4cf932a4c/fd1b73ed3395420c8378f653269a044f [2024-09-12 15:21:16,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:21:16,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:21:16,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:21:16,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:21:16,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:21:16,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:16,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af87eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16, skipping insertion in model container [2024-09-12 15:21:16,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:16,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:21:16,934 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/phases_1-1.c[322,335] [2024-09-12 15:21:16,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:21:16,955 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:21:16,963 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/phases_1-1.c[322,335] [2024-09-12 15:21:16,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:21:16,977 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:21:16,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16 WrapperNode [2024-09-12 15:21:16,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:21:16,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:21:16,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:21:16,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:21:16,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:16,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:16,992 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:21:16,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:21:16,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:21:16,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:21:16,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:21:17,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:17,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:17,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:17,008 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 15:21:17,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:17,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:17,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:17,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:17,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:17,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:17,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:21:17,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:21:17,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:21:17,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:21:17,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (1/1) ... [2024-09-12 15:21:17,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:21:17,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:21:17,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 15:21:17,045 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 15:21:17,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:21:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:21:17,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:21:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:21:17,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:21:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:21:17,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:21:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:21:17,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 15:21:17,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 15:21:17,121 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:21:17,122 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:21:17,239 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-12 15:21:17,240 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:21:17,282 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:21:17,282 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 15:21:17,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:21:17 BoogieIcfgContainer [2024-09-12 15:21:17,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:21:17,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:21:17,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:21:17,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:21:17,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:21:16" (1/3) ... [2024-09-12 15:21:17,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a24934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:21:17, skipping insertion in model container [2024-09-12 15:21:17,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:21:16" (2/3) ... [2024-09-12 15:21:17,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a24934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:21:17, skipping insertion in model container [2024-09-12 15:21:17,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:21:17" (3/3) ... [2024-09-12 15:21:17,292 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2024-09-12 15:21:17,323 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:21:17,323 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:21:17,380 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:21:17,385 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;@1d9fcc6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:21:17,385 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:21:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 15:21:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 15:21:17,395 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:21:17,396 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:21:17,396 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:21:17,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1330752012, now seen corresponding path program 1 times [2024-09-12 15:21:17,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:21:17,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709383775] [2024-09-12 15:21:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:21:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:21:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:17,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:21:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:21:17,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:21:17,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709383775] [2024-09-12 15:21:17,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709383775] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:21:17,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:21:17,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 15:21:17,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331062649] [2024-09-12 15:21:17,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:21:17,518 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 15:21:17,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:21:17,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 15:21:17,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:21:17,538 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:21:17,554 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-09-12 15:21:17,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 15:21:17,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 15:21:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:21:17,560 INFO L225 Difference]: With dead ends: 29 [2024-09-12 15:21:17,561 INFO L226 Difference]: Without dead ends: 12 [2024-09-12 15:21:17,563 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:21:17,565 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:21:17,566 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:21:17,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-12 15:21:17,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-12 15:21:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-09-12 15:21:17,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-09-12 15:21:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:21:17,591 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-09-12 15:21:17,591 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:17,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-09-12 15:21:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 15:21:17,592 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:21:17,592 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:21:17,592 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:21:17,593 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:21:17,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:17,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1321516802, now seen corresponding path program 1 times [2024-09-12 15:21:17,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:21:17,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258216369] [2024-09-12 15:21:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:21:17,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:21:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:17,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:21:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:17,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:21:17,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:21:17,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258216369] [2024-09-12 15:21:17,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258216369] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:21:17,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:21:17,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:21:17,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511301616] [2024-09-12 15:21:17,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:21:17,682 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:21:17,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:21:17,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:21:17,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:21:17,683 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:21:17,701 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-09-12 15:21:17,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:21:17,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 15:21:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:21:17,702 INFO L225 Difference]: With dead ends: 21 [2024-09-12 15:21:17,702 INFO L226 Difference]: Without dead ends: 14 [2024-09-12 15:21:17,702 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:21:17,703 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:21:17,704 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:21:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-12 15:21:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-09-12 15:21:17,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-09-12 15:21:17,708 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2024-09-12 15:21:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:21:17,708 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-09-12 15:21:17,708 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:17,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:17,709 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-09-12 15:21:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 15:21:17,709 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:21:17,709 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:21:17,710 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 15:21:17,710 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:21:17,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:17,710 INFO L85 PathProgramCache]: Analyzing trace with hash -257340833, now seen corresponding path program 1 times [2024-09-12 15:21:17,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:21:17,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738457773] [2024-09-12 15:21:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:21:17,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:21:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:17,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:21:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:21:17,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:21:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738457773] [2024-09-12 15:21:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738457773] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:21:17,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450821839] [2024-09-12 15:21:17,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:21:17,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:21:17,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:21:17,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:21:17,855 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 15:21:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:17,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 15:21:17,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:21:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:21:17,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:21:17,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:21:17,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450821839] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:21:17,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:21:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 15:21:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363225518] [2024-09-12 15:21:17,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:21:17,982 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:21:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:21:17,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:21:17,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:21:17,985 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:21:18,042 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-09-12 15:21:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:21:18,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 15:21:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:21:18,043 INFO L225 Difference]: With dead ends: 25 [2024-09-12 15:21:18,044 INFO L226 Difference]: Without dead ends: 18 [2024-09-12 15:21:18,044 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-12 15:21:18,046 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:21:18,048 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:21:18,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-12 15:21:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-09-12 15:21:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:18,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-09-12 15:21:18,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2024-09-12 15:21:18,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:21:18,056 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-09-12 15:21:18,057 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:18,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-09-12 15:21:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 15:21:18,057 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:21:18,057 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:21:18,071 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 15:21:18,262 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:21:18,263 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:21:18,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:18,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1791473815, now seen corresponding path program 1 times [2024-09-12 15:21:18,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:21:18,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063957601] [2024-09-12 15:21:18,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:21:18,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:21:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:18,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:21:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:21:18,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:21:18,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063957601] [2024-09-12 15:21:18,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063957601] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:21:18,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979367625] [2024-09-12 15:21:18,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:21:18,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:21:18,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:21:18,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:21:18,391 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 15:21:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:18,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 15:21:18,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:21:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:21:18,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:21:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:21:18,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979367625] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:21:18,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:21:18,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-09-12 15:21:18,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020938020] [2024-09-12 15:21:18,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:21:18,572 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 15:21:18,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:21:18,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 15:21:18,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:21:18,573 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:21:18,638 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-09-12 15:21:18,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 15:21:18,638 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-12 15:21:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:21:18,639 INFO L225 Difference]: With dead ends: 33 [2024-09-12 15:21:18,639 INFO L226 Difference]: Without dead ends: 22 [2024-09-12 15:21:18,643 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-12 15:21:18,644 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:21:18,644 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:21:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-12 15:21:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-09-12 15:21:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:18,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-09-12 15:21:18,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2024-09-12 15:21:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:21:18,651 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-09-12 15:21:18,651 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:18,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-09-12 15:21:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 15:21:18,652 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:21:18,652 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:21:18,667 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 15:21:18,856 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:21:18,857 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:21:18,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:18,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1266387508, now seen corresponding path program 2 times [2024-09-12 15:21:18,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:21:18,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094025468] [2024-09-12 15:21:18,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:21:18,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:21:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:18,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:21:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:21:18,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:21:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094025468] [2024-09-12 15:21:18,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094025468] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:21:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610971070] [2024-09-12 15:21:18,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 15:21:18,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:21:18,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:21:18,981 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:21:18,988 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 15:21:19,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 15:21:19,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:21:19,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 15:21:19,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:21:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:21:19,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:21:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:21:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610971070] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:21:19,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:21:19,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2024-09-12 15:21:19,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751131583] [2024-09-12 15:21:19,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:21:19,118 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 15:21:19,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:21:19,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 15:21:19,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2024-09-12 15:21:19,119 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:21:19,223 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-12 15:21:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 15:21:19,223 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 15:21:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:21:19,225 INFO L225 Difference]: With dead ends: 42 [2024-09-12 15:21:19,225 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 15:21:19,226 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2024-09-12 15:21:19,226 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:21:19,226 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:21:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 15:21:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2024-09-12 15:21:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-12 15:21:19,233 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2024-09-12 15:21:19,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:21:19,233 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-12 15:21:19,233 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:19,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:19,234 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-12 15:21:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 15:21:19,234 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:21:19,234 INFO L216 NwaCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:21:19,246 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 15:21:19,438 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:21:19,439 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:21:19,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1613671460, now seen corresponding path program 3 times [2024-09-12 15:21:19,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:21:19,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769792226] [2024-09-12 15:21:19,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:21:19,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:21:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:19,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:21:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:21:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:21:19,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769792226] [2024-09-12 15:21:19,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769792226] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:21:19,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961087535] [2024-09-12 15:21:19,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 15:21:19,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:21:19,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:21:19,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:21:19,593 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 15:21:19,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-09-12 15:21:19,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:21:19,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 15:21:19,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:21:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-12 15:21:19,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:21:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-12 15:21:19,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961087535] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:21:19,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:21:19,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2024-09-12 15:21:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363345767] [2024-09-12 15:21:19,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:21:19,782 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 15:21:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:21:19,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 15:21:19,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-09-12 15:21:19,783 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 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-12 15:21:24,086 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-12 15:21:28,090 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-12 15:21:32,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 15:21:36,224 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-12 15:21:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:21:36,267 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2024-09-12 15:21:36,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 15:21:36,268 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 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 26 [2024-09-12 15:21:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:21:36,269 INFO L225 Difference]: With dead ends: 94 [2024-09-12 15:21:36,270 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 15:21:36,271 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=425, Unknown=0, NotChecked=0, Total=650 [2024-09-12 15:21:36,271 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 20 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:21:36,271 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 174 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2024-09-12 15:21:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 15:21:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 41. [2024-09-12 15:21:36,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 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-12 15:21:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-09-12 15:21:36,294 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 26 [2024-09-12 15:21:36,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:21:36,294 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-09-12 15:21:36,294 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 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-12 15:21:36,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-09-12 15:21:36,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 15:21:36,295 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:21:36,295 INFO L216 NwaCegarLoop]: trace histogram [15, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:21:36,313 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 15:21:36,496 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:21:36,496 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:21:36,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:36,497 INFO L85 PathProgramCache]: Analyzing trace with hash 644275237, now seen corresponding path program 4 times [2024-09-12 15:21:36,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:21:36,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777291679] [2024-09-12 15:21:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:21:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:21:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:36,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:21:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 56 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 15:21:36,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:21:36,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777291679] [2024-09-12 15:21:36,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777291679] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:21:36,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803883170] [2024-09-12 15:21:36,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 15:21:36,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:21:36,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:21:36,662 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:21:36,663 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 15:21:36,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 15:21:36,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:21:36,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 15:21:36,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:21:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 117 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-12 15:21:36,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:21:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 117 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-12 15:21:37,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803883170] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:21:37,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:21:37,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 22 [2024-09-12 15:21:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545367815] [2024-09-12 15:21:37,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:21:37,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-12 15:21:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:21:37,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-12 15:21:37,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2024-09-12 15:21:37,094 INFO L87 Difference]: Start difference. First operand 41 states and 50 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-12 15:21:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:21:38,965 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2024-09-12 15:21:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-12 15:21:38,965 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-12 15:21:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:21:38,966 INFO L225 Difference]: With dead ends: 87 [2024-09-12 15:21:38,966 INFO L226 Difference]: Without dead ends: 63 [2024-09-12 15:21:38,967 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=348, Invalid=582, Unknown=0, NotChecked=0, Total=930 [2024-09-12 15:21:38,967 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 15:21:38,968 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 15:21:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-12 15:21:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-12 15:21:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 58 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:21:38,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2024-09-12 15:21:38,986 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 40 [2024-09-12 15:21:38,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:21:38,986 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2024-09-12 15:21:38,986 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-12 15:21:38,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:38,987 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2024-09-12 15:21:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-12 15:21:38,987 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:21:38,987 INFO L216 NwaCegarLoop]: trace histogram [25, 17, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:21:39,000 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 15:21:39,190 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 15:21:39,191 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:21:39,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:21:39,194 INFO L85 PathProgramCache]: Analyzing trace with hash -779631609, now seen corresponding path program 5 times [2024-09-12 15:21:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:21:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044963337] [2024-09-12 15:21:39,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:21:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:21:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:39,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:21:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:21:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 270 proven. 306 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 15:21:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:21:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044963337] [2024-09-12 15:21:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044963337] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:21:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990021103] [2024-09-12 15:21:39,655 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 15:21:39,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:21:39,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:21:39,662 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:21:39,672 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 15:21:39,737 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2024-09-12 15:21:39,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:21:39,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-12 15:21:39,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:21:39,925 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 154 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 15:21:39,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:21:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 154 proven. 462 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 15:21:41,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990021103] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:21:41,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:21:41,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 25] total 48 [2024-09-12 15:21:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042981656] [2024-09-12 15:21:41,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:21:41,071 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-12 15:21:41,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:21:41,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-12 15:21:41,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=641, Invalid=1615, Unknown=0, NotChecked=0, Total=2256 [2024-09-12 15:21:41,073 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:23:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:23:00,344 INFO L93 Difference]: Finished difference Result 133 states and 174 transitions. [2024-09-12 15:23:00,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-12 15:23:00,344 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 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 60 [2024-09-12 15:23:00,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:23:00,348 INFO L225 Difference]: With dead ends: 133 [2024-09-12 15:23:00,349 INFO L226 Difference]: Without dead ends: 109 [2024-09-12 15:23:00,351 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 80.0s TimeCoverageRelationStatistics Valid=1697, Invalid=3133, Unknown=0, NotChecked=0, Total=4830 [2024-09-12 15:23:00,351 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 15:23:00,352 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 15:23:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-09-12 15:23:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-09-12 15:23:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.0961538461538463) internal successors, (114), 104 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:23:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2024-09-12 15:23:00,380 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 60 [2024-09-12 15:23:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:23:00,381 INFO L474 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2024-09-12 15:23:00,381 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0833333333333335) internal successors, (100), 48 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:23:00,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:23:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2024-09-12 15:23:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-09-12 15:23:00,383 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:23:00,383 INFO L216 NwaCegarLoop]: trace histogram [49, 41, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:23:00,399 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-12 15:23:00,584 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:23:00,585 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:23:00,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:23:00,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1803417023, now seen corresponding path program 6 times [2024-09-12 15:23:00,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:23:00,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870817898] [2024-09-12 15:23:00,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:23:00,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:23:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:23:01,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:23:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:23:01,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 630 proven. 1722 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-12 15:23:01,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:23:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870817898] [2024-09-12 15:23:01,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870817898] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:23:01,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010679111] [2024-09-12 15:23:01,866 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 15:23:01,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:23:01,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:23:01,868 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:23:01,868 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 15:23:02,238 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2024-09-12 15:23:02,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:23:02,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 15:23:02,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:23:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 697 proven. 64 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-09-12 15:23:02,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:23:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 697 proven. 64 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-09-12 15:23:03,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010679111] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:23:03,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:23:03,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 11, 11] total 62 [2024-09-12 15:23:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604321769] [2024-09-12 15:23:03,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:23:03,099 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-09-12 15:23:03,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:23:03,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-09-12 15:23:03,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=909, Invalid=2873, Unknown=0, NotChecked=0, Total=3782 [2024-09-12 15:23:03,101 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 62 states have internal predecessors, (131), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:23:10,954 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-12 15:23:14,958 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-12 15:23:18,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 15:23:22,970 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-12 15:23:26,974 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-12 15:23:30,977 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-12 15:23:34,983 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-12 15:23:39,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 15:23:43,624 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-12 15:23:47,627 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-12 15:23:51,631 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-12 15:23:55,635 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-12 15:23:59,639 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-12 15:24:04,003 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-12 15:24:08,006 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-12 15:24:12,009 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-12 15:24:16,013 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-12 15:24:20,018 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-12 15:24:24,023 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-12 15:24:28,152 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-12 15:24:32,155 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-12 15:24:36,159 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-12 15:24:40,162 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-12 15:24:44,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-12 15:24:48,397 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-12 15:24:52,403 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-12 15:24:56,407 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-12 15:25:00,412 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-12 15:25:04,416 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-12 15:25:08,497 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-12 15:25:12,500 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-12 15:25:16,505 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-12 15:25:20,509 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-12 15:25:24,513 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-12 15:25:28,706 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-12 15:25:32,709 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-12 15:25:36,713 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-12 15:25:40,718 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-12 15:25:44,906 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-12 15:25:48,910 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-12 15:25:52,913 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-12 15:25:56,918 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-12 15:26:01,009 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-12 15:26:05,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []