./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_13.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_13.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 7a1978d5df6cab978f117700980416150440efa7bda2d4cde0711b48b83f0666 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:31:20,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:31:20,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:31:20,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:31:20,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:31:20,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:31:20,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:31:20,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:31:20,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:31:20,986 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:31:20,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:31:20,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:31:20,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:31:20,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:31:20,990 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:31:20,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:31:20,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:31:20,991 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:31:20,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:31:20,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:31:20,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:31:20,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:31:20,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:31:20,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:31:21,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:31:21,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:31:21,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:31:21,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:31:21,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:31:21,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:31:21,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:31:21,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:31:21,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:31:21,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:31:21,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:31:21,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:31:21,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:31:21,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:31:21,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:31:21,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:31:21,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:31:21,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:31:21,005 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 -> 7a1978d5df6cab978f117700980416150440efa7bda2d4cde0711b48b83f0666 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:31:21,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:31:21,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:31:21,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:31:21,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:31:21,343 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:31:21,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/mono-crafted_13.c [2024-09-25 10:31:22,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:31:23,079 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:31:23,080 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_13.c [2024-09-25 10:31:23,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/10840eeb0/8c5296bec419421086ce489573609014/FLAGdc77ce952 [2024-09-25 10:31:23,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/10840eeb0/8c5296bec419421086ce489573609014 [2024-09-25 10:31:23,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:31:23,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:31:23,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:31:23,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:31:23,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:31:23,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66626d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23, skipping insertion in model container [2024-09-25 10:31:23,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:31:23,271 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_13.c[319,332] [2024-09-25 10:31:23,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:31:23,305 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:31:23,328 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_13.c[319,332] [2024-09-25 10:31:23,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:31:23,349 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:31:23,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23 WrapperNode [2024-09-25 10:31:23,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:31:23,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:31:23,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:31:23,351 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:31:23,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,369 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:31:23,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:31:23,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:31:23,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:31:23,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:31:23,380 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,381 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,382 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,396 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:31:23,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:31:23,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:31:23,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:31:23,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:31:23,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (1/1) ... [2024-09-25 10:31:23,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:31:23,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:23,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:31:23,459 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:31:23,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:31:23,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:31:23,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:31:23,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:31:23,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:31:23,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:31:23,500 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:31:23,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:31:23,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:31:23,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:31:23,563 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:31:23,565 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:31:23,707 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-25 10:31:23,708 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:31:23,731 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:31:23,731 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:31:23,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:31:23 BoogieIcfgContainer [2024-09-25 10:31:23,732 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:31:23,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:31:23,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:31:23,738 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:31:23,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:31:23" (1/3) ... [2024-09-25 10:31:23,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cad2acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:31:23, skipping insertion in model container [2024-09-25 10:31:23,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:23" (2/3) ... [2024-09-25 10:31:23,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cad2acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:31:23, skipping insertion in model container [2024-09-25 10:31:23,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:31:23" (3/3) ... [2024-09-25 10:31:23,742 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_13.c [2024-09-25 10:31:23,758 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:31:23,758 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:31:23,814 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:31:23,820 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;@4d9893f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:31:23,820 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:31:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:31:23,831 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:23,832 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:23,833 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:23,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:23,839 INFO L85 PathProgramCache]: Analyzing trace with hash -630439525, now seen corresponding path program 1 times [2024-09-25 10:31:23,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:23,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033956761] [2024-09-25 10:31:23,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:23,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:23,976 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:23,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:23,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033956761] [2024-09-25 10:31:23,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033956761] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:23,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:23,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:31:23,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824800659] [2024-09-25 10:31:24,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:24,012 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:31:24,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:24,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:31:24,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:31:24,045 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 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.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:24,065 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-09-25 10:31:24,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:31:24,068 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2024-09-25 10:31:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:24,073 INFO L225 Difference]: With dead ends: 31 [2024-09-25 10:31:24,073 INFO L226 Difference]: Without dead ends: 13 [2024-09-25 10:31:24,075 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:31:24,079 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:24,080 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:24,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-25 10:31:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-25 10:31:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 8 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-25 10:31:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-09-25 10:31:24,111 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2024-09-25 10:31:24,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:24,111 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-09-25 10:31:24,112 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:24,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-09-25 10:31:24,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:31:24,113 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:24,113 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:24,114 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:31:24,115 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:24,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:24,120 INFO L85 PathProgramCache]: Analyzing trace with hash -920425119, now seen corresponding path program 1 times [2024-09-25 10:31:24,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:24,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556975660] [2024-09-25 10:31:24,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:24,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:24,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:24,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:24,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556975660] [2024-09-25 10:31:24,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556975660] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:24,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:31:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977034571] [2024-09-25 10:31:24,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:24,258 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:31:24,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:24,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:31:24,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:24,260 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:24,293 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2024-09-25 10:31:24,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:31:24,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2024-09-25 10:31:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:24,294 INFO L225 Difference]: With dead ends: 23 [2024-09-25 10:31:24,295 INFO L226 Difference]: Without dead ends: 15 [2024-09-25 10:31:24,295 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-25 10:31:24,296 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:24,296 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-25 10:31:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-25 10:31:24,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-09-25 10:31:24,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-09-25 10:31:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:24,306 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-09-25 10:31:24,306 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:24,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-09-25 10:31:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 10:31:24,308 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:24,308 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:24,309 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:31:24,309 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:24,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:24,310 INFO L85 PathProgramCache]: Analyzing trace with hash 478481828, now seen corresponding path program 1 times [2024-09-25 10:31:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101783991] [2024-09-25 10:31:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:24,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:24,422 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:24,427 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-25 10:31:24,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101783991] [2024-09-25 10:31:24,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101783991] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826702556] [2024-09-25 10:31:24,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:24,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:24,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:24,431 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:24,432 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:31:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:24,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:31:24,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:24,564 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-25 10:31:24,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:24,629 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-25 10:31:24,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826702556] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:24,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:24,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:31:24,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328798039] [2024-09-25 10:31:24,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:24,631 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:31:24,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:24,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:31:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:31:24,632 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:24,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:24,678 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-09-25 10:31:24,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:31:24,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 13 [2024-09-25 10:31:24,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:24,679 INFO L225 Difference]: With dead ends: 27 [2024-09-25 10:31:24,679 INFO L226 Difference]: Without dead ends: 19 [2024-09-25 10:31:24,680 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:31:24,681 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 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-25 10:31:24,682 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-25 10:31:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-09-25 10:31:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-09-25 10:31:24,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2024-09-25 10:31:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:24,687 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-09-25 10:31:24,687 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:24,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-09-25 10:31:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 10:31:24,688 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:24,688 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:24,705 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:31:24,892 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:24,893 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:24,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash 353232492, now seen corresponding path program 1 times [2024-09-25 10:31:24,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:24,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155621496] [2024-09-25 10:31:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:24,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,019 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-25 10:31:25,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:25,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155621496] [2024-09-25 10:31:25,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155621496] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:25,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568682169] [2024-09-25 10:31:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:25,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:25,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:25,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:25,026 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:31:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:31:25,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:25,095 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-25 10:31:25,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:25,158 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-25 10:31:25,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568682169] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:25,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:25,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-25 10:31:25,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150836559] [2024-09-25 10:31:25,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:25,160 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:31:25,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:25,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:31:25,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:31:25,161 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:25,204 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-09-25 10:31:25,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:31:25,208 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-25 10:31:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:25,209 INFO L225 Difference]: With dead ends: 35 [2024-09-25 10:31:25,209 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 10:31:25,210 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:31:25,210 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:25,211 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 10:31:25,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-25 10:31:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-09-25 10:31:25,228 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2024-09-25 10:31:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:25,229 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-09-25 10:31:25,229 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:25,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-09-25 10:31:25,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 10:31:25,231 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:25,231 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:25,244 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:31:25,431 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:25,432 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:25,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:25,432 INFO L85 PathProgramCache]: Analyzing trace with hash 513044984, now seen corresponding path program 2 times [2024-09-25 10:31:25,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:25,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128896924] [2024-09-25 10:31:25,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:25,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:25,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:25,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128896924] [2024-09-25 10:31:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128896924] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:25,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697545627] [2024-09-25 10:31:25,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:31:25,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:25,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:25,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:25,621 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:31:25,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:31:25,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:25,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 10:31:25,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:25,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:25,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697545627] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:25,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:25,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-09-25 10:31:25,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533961472] [2024-09-25 10:31:25,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:25,882 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 10:31:25,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:25,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 10:31:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:31:25,887 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:25,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:25,968 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2024-09-25 10:31:25,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 10:31:25,970 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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 25 [2024-09-25 10:31:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:25,971 INFO L225 Difference]: With dead ends: 51 [2024-09-25 10:31:25,971 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 10:31:25,971 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:31:25,972 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:25,972 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 10:31:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-25 10:31:25,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-09-25 10:31:25,988 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 25 [2024-09-25 10:31:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:25,989 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-09-25 10:31:25,989 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:25,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-09-25 10:31:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-25 10:31:25,990 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:25,991 INFO L216 NwaCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:26,003 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-25 10:31:26,191 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:26,191 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:26,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:26,192 INFO L85 PathProgramCache]: Analyzing trace with hash 365077776, now seen corresponding path program 3 times [2024-09-25 10:31:26,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:26,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775349617] [2024-09-25 10:31:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:26,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:26,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:26,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:26,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775349617] [2024-09-25 10:31:26,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775349617] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:26,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866587685] [2024-09-25 10:31:26,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:31:26,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:26,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:26,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:26,649 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:31:26,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-25 10:31:26,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:26,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:31:26,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-09-25 10:31:26,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:31:26,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866587685] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:26,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:31:26,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2024-09-25 10:31:26,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228152307] [2024-09-25 10:31:26,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:26,851 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:31:26,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:26,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:31:26,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:31:26,852 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:26,872 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-09-25 10:31:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:31:26,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2024-09-25 10:31:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:26,874 INFO L225 Difference]: With dead ends: 51 [2024-09-25 10:31:26,874 INFO L226 Difference]: Without dead ends: 46 [2024-09-25 10:31:26,875 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:31:26,875 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:26,876 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 23 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-25 10:31:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-09-25 10:31:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2024-09-25 10:31:26,884 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2024-09-25 10:31:26,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:26,885 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2024-09-25 10:31:26,885 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:26,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:26,886 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2024-09-25 10:31:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 10:31:26,886 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:26,887 INFO L216 NwaCegarLoop]: trace histogram [15, 14, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:26,902 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:31:27,087 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:27,087 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:27,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:27,088 INFO L85 PathProgramCache]: Analyzing trace with hash -210367184, now seen corresponding path program 1 times [2024-09-25 10:31:27,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:27,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297057820] [2024-09-25 10:31:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:27,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:27,459 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:31:27,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297057820] [2024-09-25 10:31:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297057820] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398297409] [2024-09-25 10:31:27,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:27,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:27,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:27,466 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:27,468 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:31:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:27,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-25 10:31:27,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:31:27,629 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:28,024 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:31:28,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398297409] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:28,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:28,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2024-09-25 10:31:28,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806470617] [2024-09-25 10:31:28,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:28,025 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-25 10:31:28,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:28,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-25 10:31:28,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2024-09-25 10:31:28,029 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:28,162 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2024-09-25 10:31:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-25 10:31:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 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 43 [2024-09-25 10:31:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:28,165 INFO L225 Difference]: With dead ends: 87 [2024-09-25 10:31:28,165 INFO L226 Difference]: Without dead ends: 76 [2024-09-25 10:31:28,165 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2024-09-25 10:31:28,166 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:28,167 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-25 10:31:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-09-25 10:31:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2024-09-25 10:31:28,182 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 43 [2024-09-25 10:31:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:28,183 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2024-09-25 10:31:28,183 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 33 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:28,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2024-09-25 10:31:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-09-25 10:31:28,186 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:28,186 INFO L216 NwaCegarLoop]: trace histogram [31, 30, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:28,204 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:31:28,387 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:31:28,387 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:28,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:28,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1925846880, now seen corresponding path program 2 times [2024-09-25 10:31:28,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:28,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562722104] [2024-09-25 10:31:28,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:28,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:29,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:31:29,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:29,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562722104] [2024-09-25 10:31:29,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562722104] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:29,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600001664] [2024-09-25 10:31:29,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:31:29,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:29,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:29,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:29,396 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:31:29,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:31:29,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:29,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-09-25 10:31:29,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:31:29,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:31:30,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600001664] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:30,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:30,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2024-09-25 10:31:30,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550417536] [2024-09-25 10:31:30,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:30,908 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-09-25 10:31:30,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:30,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-09-25 10:31:30,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2024-09-25 10:31:30,911 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 65 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:31,139 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2024-09-25 10:31:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-09-25 10:31:31,140 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 65 states have internal predecessors, (136), 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 75 [2024-09-25 10:31:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:31,142 INFO L225 Difference]: With dead ends: 151 [2024-09-25 10:31:31,142 INFO L226 Difference]: Without dead ends: 140 [2024-09-25 10:31:31,143 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2024-09-25 10:31:31,144 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:31,144 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:31:31,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-25 10:31:31,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-09-25 10:31:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.0222222222222221) internal successors, (138), 135 states have internal predecessors, (138), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2024-09-25 10:31:31,166 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 75 [2024-09-25 10:31:31,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:31,167 INFO L474 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2024-09-25 10:31:31,167 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.0923076923076924) internal successors, (136), 65 states have internal predecessors, (136), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:31,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:31,168 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2024-09-25 10:31:31,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-09-25 10:31:31,171 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:31,171 INFO L216 NwaCegarLoop]: trace histogram [63, 62, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:31,199 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-25 10:31:31,372 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-25 10:31:31,372 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:31,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1781273664, now seen corresponding path program 3 times [2024-09-25 10:31:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577950975] [2024-09-25 10:31:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:34,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3972 backedges. 63 proven. 3906 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 10:31:34,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577950975] [2024-09-25 10:31:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577950975] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884232988] [2024-09-25 10:31:34,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:31:34,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:34,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:34,638 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:34,640 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:31:34,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-25 10:31:34,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:34,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:31:34,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3972 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2024-09-25 10:31:35,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3972 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2024-09-25 10:31:35,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884232988] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:35,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:35,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 5, 5] total 71 [2024-09-25 10:31:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194668916] [2024-09-25 10:31:35,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:35,447 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-09-25 10:31:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:35,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-09-25 10:31:35,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2107, Invalid=2863, Unknown=0, NotChecked=0, Total=4970 [2024-09-25 10:31:35,450 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand has 71 states, 71 states have (on average 2.112676056338028) internal successors, (150), 71 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:37,431 INFO L93 Difference]: Finished difference Result 159 states and 169 transitions. [2024-09-25 10:31:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-09-25 10:31:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 2.112676056338028) internal successors, (150), 71 states have internal predecessors, (150), 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 139 [2024-09-25 10:31:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:37,435 INFO L225 Difference]: With dead ends: 159 [2024-09-25 10:31:37,435 INFO L226 Difference]: Without dead ends: 148 [2024-09-25 10:31:37,439 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2337 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=6454, Invalid=11368, Unknown=0, NotChecked=0, Total=17822 [2024-09-25 10:31:37,440 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:37,440 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-09-25 10:31:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-09-25 10:31:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0212765957446808) internal successors, (144), 141 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:37,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2024-09-25 10:31:37,461 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 139 [2024-09-25 10:31:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:37,461 INFO L474 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2024-09-25 10:31:37,462 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 2.112676056338028) internal successors, (150), 71 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:37,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2024-09-25 10:31:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-09-25 10:31:37,464 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:37,464 INFO L216 NwaCegarLoop]: trace histogram [64, 63, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:37,481 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 10:31:37,665 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:37,665 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:37,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:37,666 INFO L85 PathProgramCache]: Analyzing trace with hash -890178877, now seen corresponding path program 4 times [2024-09-25 10:31:37,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:37,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598096946] [2024-09-25 10:31:37,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:37,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4117 backedges. 64 proven. 4032 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-25 10:31:40,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:40,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598096946] [2024-09-25 10:31:40,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598096946] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:40,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810902136] [2024-09-25 10:31:40,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:31:40,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:40,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:40,530 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:40,532 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:31:40,642 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:31:40,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:40,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 128 conjuncts are in the unsatisfiable core [2024-09-25 10:31:40,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4117 backedges. 64 proven. 4032 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-25 10:31:40,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4117 backedges. 64 proven. 4032 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-25 10:31:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810902136] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:44,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2024-09-25 10:31:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726804276] [2024-09-25 10:31:44,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:44,934 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2024-09-25 10:31:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:44,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2024-09-25 10:31:44,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2024-09-25 10:31:44,941 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand has 131 states, 131 states have (on average 2.045801526717557) internal successors, (268), 131 states have internal predecessors, (268), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:45,294 INFO L93 Difference]: Finished difference Result 291 states and 360 transitions. [2024-09-25 10:31:45,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2024-09-25 10:31:45,295 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 131 states have (on average 2.045801526717557) internal successors, (268), 131 states have internal predecessors, (268), 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 145 [2024-09-25 10:31:45,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:45,296 INFO L225 Difference]: With dead ends: 291 [2024-09-25 10:31:45,296 INFO L226 Difference]: Without dead ends: 276 [2024-09-25 10:31:45,299 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2024-09-25 10:31:45,300 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:45,300 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:31:45,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-09-25 10:31:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-09-25 10:31:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 271 states have (on average 1.011070110701107) internal successors, (274), 271 states have internal predecessors, (274), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2024-09-25 10:31:45,332 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 145 [2024-09-25 10:31:45,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:45,333 INFO L474 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2024-09-25 10:31:45,333 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 2.045801526717557) internal successors, (268), 131 states have internal predecessors, (268), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:45,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:45,333 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2024-09-25 10:31:45,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-09-25 10:31:45,337 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:45,337 INFO L216 NwaCegarLoop]: trace histogram [129, 128, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:45,353 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-25 10:31:45,537 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:45,538 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:45,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:45,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1941884294, now seen corresponding path program 5 times [2024-09-25 10:31:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:45,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955185651] [2024-09-25 10:31:45,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:56,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16662 backedges. 129 proven. 16512 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-25 10:31:56,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:56,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955185651] [2024-09-25 10:31:56,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955185651] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:56,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009558101] [2024-09-25 10:31:56,738 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:31:56,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:56,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:56,741 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:56,741 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 10:31:57,040 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 130 check-sat command(s) [2024-09-25 10:31:57,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:57,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 258 conjuncts are in the unsatisfiable core [2024-09-25 10:31:57,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16662 backedges. 129 proven. 16512 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-25 10:31:57,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:32:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 16662 backedges. 129 proven. 16512 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-25 10:32:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009558101] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:32:13,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:32:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131, 131] total 261 [2024-09-25 10:32:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901442734] [2024-09-25 10:32:13,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:32:13,054 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 261 states [2024-09-25 10:32:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:32:13,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 261 interpolants. [2024-09-25 10:32:13,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33930, Invalid=33930, Unknown=0, NotChecked=0, Total=67860 [2024-09-25 10:32:13,066 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand has 261 states, 261 states have (on average 2.0229885057471266) internal successors, (528), 261 states have internal predecessors, (528), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:14,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:32:14,186 INFO L93 Difference]: Finished difference Result 551 states and 685 transitions. [2024-09-25 10:32:14,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2024-09-25 10:32:14,187 INFO L78 Accepts]: Start accepts. Automaton has has 261 states, 261 states have (on average 2.0229885057471266) internal successors, (528), 261 states have internal predecessors, (528), 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 275 [2024-09-25 10:32:14,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:32:14,189 INFO L225 Difference]: With dead ends: 551 [2024-09-25 10:32:14,190 INFO L226 Difference]: Without dead ends: 536 [2024-09-25 10:32:14,193 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=33930, Invalid=33930, Unknown=0, NotChecked=0, Total=67860 [2024-09-25 10:32:14,194 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:32:14,194 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:32:14,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-09-25 10:32:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2024-09-25 10:32:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 531 states have (on average 1.0056497175141244) internal successors, (534), 531 states have internal predecessors, (534), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 538 transitions. [2024-09-25 10:32:14,247 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 538 transitions. Word has length 275 [2024-09-25 10:32:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:32:14,248 INFO L474 AbstractCegarLoop]: Abstraction has 536 states and 538 transitions. [2024-09-25 10:32:14,248 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 261 states, 261 states have (on average 2.0229885057471266) internal successors, (528), 261 states have internal predecessors, (528), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:14,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 538 transitions. [2024-09-25 10:32:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2024-09-25 10:32:14,257 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:32:14,257 INFO L216 NwaCegarLoop]: trace histogram [259, 258, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:32:14,275 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 10:32:14,457 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 10:32:14,458 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:32:14,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1237568308, now seen corresponding path program 6 times [2024-09-25 10:32:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:32:14,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376873595] [2024-09-25 10:32:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:32:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:32:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:07,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 67102 backedges. 259 proven. 66822 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-25 10:33:07,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:07,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376873595] [2024-09-25 10:33:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376873595] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:07,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672770106] [2024-09-25 10:33:07,942 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:33:07,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:07,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:07,944 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:33:07,945 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 10:33:08,101 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-09-25 10:33:08,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:33:08,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-25 10:33:08,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:08,462 INFO L134 CoverageAnalysis]: Checked inductivity of 67102 backedges. 774 proven. 1 refuted. 0 times theorem prover too weak. 66327 trivial. 0 not checked. [2024-09-25 10:33:08,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:33:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 67102 backedges. 774 proven. 1 refuted. 0 times theorem prover too weak. 66327 trivial. 0 not checked. [2024-09-25 10:33:08,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672770106] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:33:08,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:33:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [261, 4, 4] total 265 [2024-09-25 10:33:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028391211] [2024-09-25 10:33:08,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:33:08,825 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 265 states [2024-09-25 10:33:08,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 265 interpolants. [2024-09-25 10:33:08,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34980, Invalid=34980, Unknown=0, NotChecked=0, Total=69960 [2024-09-25 10:33:08,842 INFO L87 Difference]: Start difference. First operand 536 states and 538 transitions. Second operand has 265 states, 265 states have (on average 2.026415094339623) internal successors, (537), 265 states have internal predecessors, (537), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:33:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:09,806 INFO L93 Difference]: Finished difference Result 559 states and 570 transitions. [2024-09-25 10:33:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2024-09-25 10:33:09,807 INFO L78 Accepts]: Start accepts. Automaton has has 265 states, 265 states have (on average 2.026415094339623) internal successors, (537), 265 states have internal predecessors, (537), 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 535 [2024-09-25 10:33:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:09,811 INFO L225 Difference]: With dead ends: 559 [2024-09-25 10:33:09,811 INFO L226 Difference]: Without dead ends: 544 [2024-09-25 10:33:09,815 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1332 GetRequests, 1069 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=34980, Invalid=34980, Unknown=0, NotChecked=0, Total=69960 [2024-09-25 10:33:09,816 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:09,816 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:33:09,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-09-25 10:33:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2024-09-25 10:33:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 539 states have (on average 1.0111317254174397) internal successors, (545), 539 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:33:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 549 transitions. [2024-09-25 10:33:09,865 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 549 transitions. Word has length 535 [2024-09-25 10:33:09,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:09,867 INFO L474 AbstractCegarLoop]: Abstraction has 544 states and 549 transitions. [2024-09-25 10:33:09,868 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 265 states, 265 states have (on average 2.026415094339623) internal successors, (537), 265 states have internal predecessors, (537), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:33:09,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:09,868 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 549 transitions. [2024-09-25 10:33:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2024-09-25 10:33:09,875 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:09,876 INFO L216 NwaCegarLoop]: trace histogram [263, 259, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:09,893 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-25 10:33:10,076 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-25 10:33:10,076 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:10,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:10,077 INFO L85 PathProgramCache]: Analyzing trace with hash -387761314, now seen corresponding path program 7 times [2024-09-25 10:33:10,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:10,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173482374] [2024-09-25 10:33:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:04,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:34:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 69190 backedges. 1820 proven. 67340 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 10:34:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:34:04,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173482374] [2024-09-25 10:34:04,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173482374] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:34:04,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719577039] [2024-09-25 10:34:04,048 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:34:04,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:34:04,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:34:04,050 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:34:04,052 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 10:34:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:04,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 520 conjuncts are in the unsatisfiable core [2024-09-25 10:34:04,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:34:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 69190 backedges. 1820 proven. 67340 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 10:34:04,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:35:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 69190 backedges. 1820 proven. 67340 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 10:35:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719577039] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:35:08,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:35:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [262, 262, 262] total 523 [2024-09-25 10:35:08,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776900714] [2024-09-25 10:35:08,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:35:08,019 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 523 states [2024-09-25 10:35:08,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:35:08,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 523 interpolants. [2024-09-25 10:35:08,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136503, Invalid=136503, Unknown=0, NotChecked=0, Total=273006 [2024-09-25 10:35:08,061 INFO L87 Difference]: Start difference. First operand 544 states and 549 transitions. Second operand has 523 states, 523 states have (on average 2.0152963671128106) internal successors, (1054), 523 states have internal predecessors, (1054), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:13,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:35:13,641 INFO L93 Difference]: Finished difference Result 1087 states and 1358 transitions. [2024-09-25 10:35:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 522 states. [2024-09-25 10:35:13,642 INFO L78 Accepts]: Start accepts. Automaton has has 523 states, 523 states have (on average 2.0152963671128106) internal successors, (1054), 523 states have internal predecessors, (1054), 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 543 [2024-09-25 10:35:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:35:13,647 INFO L225 Difference]: With dead ends: 1087 [2024-09-25 10:35:13,647 INFO L226 Difference]: Without dead ends: 1066 [2024-09-25 10:35:13,658 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1349 GetRequests, 828 SyntacticMatches, 0 SemanticMatches, 521 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 83.1s TimeCoverageRelationStatistics Valid=136503, Invalid=136503, Unknown=0, NotChecked=0, Total=273006 [2024-09-25 10:35:13,659 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-25 10:35:13,659 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-25 10:35:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2024-09-25 10:35:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1066. [2024-09-25 10:35:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1061 states have (on average 1.0056550424128181) internal successors, (1067), 1061 states have internal predecessors, (1067), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1071 transitions. [2024-09-25 10:35:13,745 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1071 transitions. Word has length 543 [2024-09-25 10:35:13,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:35:13,746 INFO L474 AbstractCegarLoop]: Abstraction has 1066 states and 1071 transitions. [2024-09-25 10:35:13,747 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 523 states, 523 states have (on average 2.0152963671128106) internal successors, (1054), 523 states have internal predecessors, (1054), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:13,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1071 transitions. [2024-09-25 10:35:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2024-09-25 10:35:13,756 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:13,756 INFO L216 NwaCegarLoop]: trace histogram [524, 520, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:13,772 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-25 10:35:13,956 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:35:13,957 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:13,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash 821473965, now seen corresponding path program 8 times [2024-09-25 10:35:13,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:35:13,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867086102] [2024-09-25 10:35:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:35:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat