./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.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 c506323d3bd63f7e6137c28fc1be825d2491f66f4e75ccbab60530df37ca16f1 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:31:10,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:31:10,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:31:10,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:31:10,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:31:11,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:31:11,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:31:11,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:31:11,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:31:11,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:31:11,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:31:11,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:31:11,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:31:11,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:31:11,016 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:31:11,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:31:11,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:31:11,017 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:31:11,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:31:11,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:31:11,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:31:11,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:31:11,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:31:11,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:31:11,019 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:31:11,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:31:11,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:31:11,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:31:11,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:31:11,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:31:11,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:31:11,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:31:11,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:31:11,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:31:11,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:31:11,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:31:11,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:31:11,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:31:11,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:31:11,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:31:11,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:31:11,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:31:11,025 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 -> c506323d3bd63f7e6137c28fc1be825d2491f66f4e75ccbab60530df37ca16f1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 19:31:11,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:31:11,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:31:11,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:31:11,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:31:11,307 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:31:11,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2024-09-11 19:31:12,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:31:12,838 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:31:12,839 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2024-09-11 19:31:12,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/df51d3e0e/508d36e73bf645cc838368d76f334006/FLAGf700f1108 [2024-09-11 19:31:12,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/df51d3e0e/508d36e73bf645cc838368d76f334006 [2024-09-11 19:31:12,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:31:12,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:31:12,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:31:12,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:31:12,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:31:12,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:31:12" (1/1) ... [2024-09-11 19:31:12,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62dd5be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:12, skipping insertion in model container [2024-09-11 19:31:12,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:31:12" (1/1) ... [2024-09-11 19:31:12,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:31:13,019 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c[319,332] [2024-09-11 19:31:13,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:31:13,040 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:31:13,052 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c[319,332] [2024-09-11 19:31:13,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:31:13,073 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:31:13,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13 WrapperNode [2024-09-11 19:31:13,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:31:13,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:31:13,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:31:13,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:31:13,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,110 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2024-09-11 19:31:13,110 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:31:13,111 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:31:13,111 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:31:13,111 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:31:13,120 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,132 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 19:31:13,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:31:13,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:31:13,150 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:31:13,150 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:31:13,151 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (1/1) ... [2024-09-11 19:31:13,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:31:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:31:13,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 19:31:13,192 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 19:31:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:31:13,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:31:13,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:31:13,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:31:13,292 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:31:13,293 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:31:13,415 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 19:31:13,416 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:31:13,440 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:31:13,441 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 19:31:13,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:31:13 BoogieIcfgContainer [2024-09-11 19:31:13,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:31:13,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:31:13,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:31:13,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:31:13,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:31:12" (1/3) ... [2024-09-11 19:31:13,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed4ad21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:31:13, skipping insertion in model container [2024-09-11 19:31:13,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:31:13" (2/3) ... [2024-09-11 19:31:13,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed4ad21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:31:13, skipping insertion in model container [2024-09-11 19:31:13,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:31:13" (3/3) ... [2024-09-11 19:31:13,453 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2024-09-11 19:31:13,467 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:31:13,467 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:31:13,512 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:31:13,517 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;@75f247fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:31:13,518 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:31:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:13,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-11 19:31:13,525 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:31:13,526 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-11 19:31:13,526 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:31:13,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash 62462887, now seen corresponding path program 1 times [2024-09-11 19:31:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:31:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478855698] [2024-09-11 19:31:13,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:31:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:31:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:31:13,677 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-11 19:31:13,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:31:13,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478855698] [2024-09-11 19:31:13,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478855698] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:31:13,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:31:13,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:31:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680120413] [2024-09-11 19:31:13,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:31:13,685 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:31:13,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:31:13,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:31:13,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:31:13,705 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:31:13,725 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2024-09-11 19:31:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:31:13,728 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-11 19:31:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:31:13,734 INFO L225 Difference]: With dead ends: 15 [2024-09-11 19:31:13,734 INFO L226 Difference]: Without dead ends: 7 [2024-09-11 19:31:13,737 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:31:13,739 INFO L434 NwaCegarLoop]: 8 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, 8 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:31:13,740 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:31:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2024-09-11 19:31:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-09-11 19:31:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-09-11 19:31:13,768 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2024-09-11 19:31:13,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:31:13,769 INFO L474 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-09-11 19:31:13,769 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:13,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2024-09-11 19:31:13,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-11 19:31:13,770 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:31:13,770 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-11 19:31:13,771 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:31:13,771 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:31:13,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash 62164977, now seen corresponding path program 1 times [2024-09-11 19:31:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:31:13,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367514186] [2024-09-11 19:31:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:31:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:31:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:31:13,871 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-11 19:31:13,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:31:13,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367514186] [2024-09-11 19:31:13,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367514186] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:31:13,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:31:13,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:31:13,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552831729] [2024-09-11 19:31:13,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:31:13,876 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:31:13,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:31:13,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:31:13,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:31:13,879 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:31:13,899 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2024-09-11 19:31:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:31:13,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-11 19:31:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:31:13,900 INFO L225 Difference]: With dead ends: 15 [2024-09-11 19:31:13,900 INFO L226 Difference]: Without dead ends: 9 [2024-09-11 19:31:13,900 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:31:13,902 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:31:13,903 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 7 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:31:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-09-11 19:31:13,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-09-11 19:31:13,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-09-11 19:31:13,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 5 [2024-09-11 19:31:13,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:31:13,907 INFO L474 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-09-11 19:31:13,907 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:13,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2024-09-11 19:31:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-09-11 19:31:13,908 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:31:13,908 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:31:13,909 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:31:13,909 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:31:13,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash -338656492, now seen corresponding path program 1 times [2024-09-11 19:31:13,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:31:13,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818903631] [2024-09-11 19:31:13,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:31:13,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:31:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:31:14,022 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-11 19:31:14,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:31:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818903631] [2024-09-11 19:31:14,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818903631] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:31:14,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222389767] [2024-09-11 19:31:14,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:31:14,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:31:14,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:31:14,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:31:14,035 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 19:31:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:31:14,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-11 19:31:14,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:31:14,128 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-11 19:31:14,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:31:14,183 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-11 19:31:14,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222389767] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:31:14,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:31:14,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-09-11 19:31:14,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863082888] [2024-09-11 19:31:14,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:31:14,184 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:31:14,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:31:14,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:31:14,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:31:14,187 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:31:14,261 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2024-09-11 19:31:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:31:14,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-09-11 19:31:14,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:31:14,263 INFO L225 Difference]: With dead ends: 19 [2024-09-11 19:31:14,263 INFO L226 Difference]: Without dead ends: 13 [2024-09-11 19:31:14,264 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:31:14,266 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:31:14,266 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:31:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-11 19:31:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-09-11 19:31:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-09-11 19:31:14,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 7 [2024-09-11 19:31:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:31:14,275 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-09-11 19:31:14,275 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:14,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-09-11 19:31:14,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 19:31:14,279 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:31:14,279 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 19:31:14,293 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:31:14,483 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:31:14,484 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:31:14,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash 28316188, now seen corresponding path program 1 times [2024-09-11 19:31:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:31:14,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997879725] [2024-09-11 19:31:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:31:14,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:31:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:31:14,687 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-11 19:31:14,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:31:14,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997879725] [2024-09-11 19:31:14,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997879725] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:31:14,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948921104] [2024-09-11 19:31:14,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:31:14,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:31:14,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:31:14,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:31:14,696 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 19:31:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:31:14,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 19:31:14,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:31:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:31:14,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:31:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:31:14,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948921104] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:31:14,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:31:14,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2024-09-11 19:31:14,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838160927] [2024-09-11 19:31:14,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:31:14,853 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:31:14,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:31:14,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:31:14,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:31:14,856 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:31:14,935 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-09-11 19:31:14,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:31:14,936 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-09-11 19:31:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:31:14,937 INFO L225 Difference]: With dead ends: 26 [2024-09-11 19:31:14,937 INFO L226 Difference]: Without dead ends: 17 [2024-09-11 19:31:14,937 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:31:14,938 INFO L434 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:31:14,939 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:31:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-11 19:31:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-09-11 19:31:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-11 19:31:14,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2024-09-11 19:31:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:31:14,950 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-11 19:31:14,951 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:14,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-11 19:31:14,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 19:31:14,954 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:31:14,954 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2024-09-11 19:31:14,972 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-11 19:31:15,154 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-11 19:31:15,155 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:31:15,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash -280764673, now seen corresponding path program 2 times [2024-09-11 19:31:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:31:15,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791889934] [2024-09-11 19:31:15,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:31:15,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:31:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:31:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:31:15,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:31:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791889934] [2024-09-11 19:31:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791889934] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:31:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321770450] [2024-09-11 19:31:15,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:31:15,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:31:15,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:31:15,353 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:31:15,355 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 19:31:15,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:31:15,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:31:15,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 19:31:15,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:31:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:31:15,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:31:15,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:31:15,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321770450] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:31:15,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:31:15,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 11 [2024-09-11 19:31:15,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402836500] [2024-09-11 19:31:15,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:31:15,579 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 19:31:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:31:15,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 19:31:15,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:31:15,582 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:15,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:31:15,832 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-09-11 19:31:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 19:31:15,834 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-09-11 19:31:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:31:15,835 INFO L225 Difference]: With dead ends: 35 [2024-09-11 19:31:15,835 INFO L226 Difference]: Without dead ends: 26 [2024-09-11 19:31:15,835 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:31:15,836 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:31:15,836 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:31:15,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-11 19:31:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-11 19:31:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-09-11 19:31:15,851 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 13 [2024-09-11 19:31:15,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:31:15,852 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-09-11 19:31:15,853 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:15,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-09-11 19:31:15,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 19:31:15,854 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:31:15,854 INFO L216 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2024-09-11 19:31:15,871 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:31:16,055 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-11 19:31:16,055 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:31:16,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash -531885935, now seen corresponding path program 3 times [2024-09-11 19:31:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:31:16,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828330770] [2024-09-11 19:31:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:31:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:31:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:31:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:31:16,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:31:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828330770] [2024-09-11 19:31:16,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828330770] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:31:16,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803167338] [2024-09-11 19:31:16,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:31:16,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:31:16,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:31:16,323 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:31:16,324 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 19:31:16,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-11 19:31:16,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:31:16,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:31:16,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:31:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-11 19:31:16,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:31:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-11 19:31:16,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803167338] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:31:16,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:31:16,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 16 [2024-09-11 19:31:16,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204644094] [2024-09-11 19:31:16,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:31:16,493 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-11 19:31:16,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:31:16,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-11 19:31:16,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-09-11 19:31:16,496 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:16,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:31:16,722 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2024-09-11 19:31:16,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-11 19:31:16,722 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-09-11 19:31:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:31:16,724 INFO L225 Difference]: With dead ends: 56 [2024-09-11 19:31:16,725 INFO L226 Difference]: Without dead ends: 47 [2024-09-11 19:31:16,726 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:31:16,726 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:31:16,728 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:31:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-11 19:31:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2024-09-11 19:31:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-09-11 19:31:16,745 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2024-09-11 19:31:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:31:16,746 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-09-11 19:31:16,747 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:16,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-09-11 19:31:16,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 19:31:16,748 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:31:16,748 INFO L216 NwaCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1] [2024-09-11 19:31:16,764 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 19:31:16,948 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-11 19:31:16,948 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:31:16,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2086199994, now seen corresponding path program 4 times [2024-09-11 19:31:16,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:31:16,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265439550] [2024-09-11 19:31:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:31:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:31:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:31:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:31:17,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:31:17,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265439550] [2024-09-11 19:31:17,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265439550] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:31:17,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824280820] [2024-09-11 19:31:17,182 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 19:31:17,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:31:17,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:31:17,185 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:31:17,187 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 19:31:17,236 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 19:31:17,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:31:17,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-11 19:31:17,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:31:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 65 proven. 156 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:31:17,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:31:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 65 proven. 156 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:31:17,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824280820] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:31:17,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:31:17,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 29 [2024-09-11 19:31:17,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313231985] [2024-09-11 19:31:17,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:31:17,922 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-11 19:31:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:31:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-11 19:31:17,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2024-09-11 19:31:17,924 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:31:25,932 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2024-09-11 19:31:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-11 19:31:25,933 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-09-11 19:31:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:31:25,935 INFO L225 Difference]: With dead ends: 81 [2024-09-11 19:31:25,935 INFO L226 Difference]: Without dead ends: 66 [2024-09-11 19:31:25,936 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=656, Invalid=1150, Unknown=0, NotChecked=0, Total=1806 [2024-09-11 19:31:25,938 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:31:25,939 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:31:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-11 19:31:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-11 19:31:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-09-11 19:31:25,975 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 35 [2024-09-11 19:31:25,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:31:25,975 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-09-11 19:31:25,975 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:25,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-09-11 19:31:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-11 19:31:25,977 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:31:25,978 INFO L216 NwaCegarLoop]: trace histogram [29, 25, 4, 1, 1, 1, 1, 1] [2024-09-11 19:31:25,995 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 19:31:26,181 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-11 19:31:26,182 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:31:26,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:31:26,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1020971888, now seen corresponding path program 5 times [2024-09-11 19:31:26,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:31:26,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240984538] [2024-09-11 19:31:26,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:31:26,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:31:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:31:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 182 proven. 650 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:31:26,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:31:26,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240984538] [2024-09-11 19:31:26,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240984538] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:31:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800515104] [2024-09-11 19:31:26,943 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 19:31:26,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:31:26,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:31:26,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:31:26,946 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 19:31:27,062 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2024-09-11 19:31:27,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:31:27,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-11 19:31:27,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:31:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 182 proven. 650 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:31:27,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:31:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 182 proven. 650 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:31:28,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800515104] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:31:28,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:31:28,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 28] total 55 [2024-09-11 19:31:28,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792551572] [2024-09-11 19:31:28,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:31:28,559 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-09-11 19:31:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:31:28,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-09-11 19:31:28,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=865, Invalid=2215, Unknown=0, NotChecked=0, Total=3080 [2024-09-11 19:31:28,562 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 56 states, 56 states have (on average 2.0535714285714284) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:31:44,524 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 157 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:33:52,074 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification. DAG size of input: 159 DAG size of output: 15 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:33:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:33:52,092 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2024-09-11 19:33:52,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-09-11 19:33:52,092 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0535714285714284) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-09-11 19:33:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:33:52,094 INFO L225 Difference]: With dead ends: 135 [2024-09-11 19:33:52,094 INFO L226 Difference]: Without dead ends: 120 [2024-09-11 19:33:52,095 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 144.3s TimeCoverageRelationStatistics Valid=2321, Invalid=4321, Unknown=0, NotChecked=0, Total=6642 [2024-09-11 19:33:52,096 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-11 19:33:52,096 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-11 19:33:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-11 19:33:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-09-11 19:33:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.050420168067227) internal successors, (125), 119 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:33:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2024-09-11 19:33:52,137 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 63 [2024-09-11 19:33:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:33:52,137 INFO L474 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2024-09-11 19:33:52,137 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0535714285714284) internal successors, (115), 55 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:33:52,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:52,138 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2024-09-11 19:33:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-09-11 19:33:52,140 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:33:52,140 INFO L216 NwaCegarLoop]: trace histogram [57, 53, 4, 1, 1, 1, 1, 1] [2024-09-11 19:33:52,153 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-11 19:33:52,341 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-11 19:33:52,341 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:33:52,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:33:52,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1553211076, now seen corresponding path program 6 times [2024-09-11 19:33:52,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:33:52,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373189431] [2024-09-11 19:33:52,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:33:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:33:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:33:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 378 proven. 2862 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:33:54,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:33:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373189431] [2024-09-11 19:33:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373189431] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:33:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340459301] [2024-09-11 19:33:54,753 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-11 19:33:54,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:33:54,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:33:54,754 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-11 19:33:54,755 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-11 19:33:54,867 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2024-09-11 19:33:54,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:33:54,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:33:54,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:33:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 477 proven. 16 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2024-09-11 19:33:55,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:33:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 477 proven. 16 refuted. 0 times theorem prover too weak. 2756 trivial. 0 not checked. [2024-09-11 19:33:55,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340459301] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:33:55,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:33:55,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 7, 7] total 66 [2024-09-11 19:33:55,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927759579] [2024-09-11 19:33:55,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:33:55,417 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-09-11 19:33:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:33:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-09-11 19:33:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=717, Invalid=3573, Unknown=0, NotChecked=0, Total=4290 [2024-09-11 19:33:55,419 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:34:01,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:05,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:09,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:14,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:18,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:22,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:26,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:30,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:34,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:38,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-09-11 19:34:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:34:38,697 INFO L93 Difference]: Finished difference Result 210 states and 263 transitions. [2024-09-11 19:34:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-09-11 19:34:38,698 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-09-11 19:34:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:34:38,700 INFO L225 Difference]: With dead ends: 210 [2024-09-11 19:34:38,700 INFO L226 Difference]: Without dead ends: 195 [2024-09-11 19:34:38,702 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1677, Invalid=4803, Unknown=0, NotChecked=0, Total=6480 [2024-09-11 19:34:38,702 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4971 mSolverCounterSat, 36 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4971 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.7s IncrementalHoareTripleChecker+Time [2024-09-11 19:34:38,703 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 18 Invalid, 5017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4971 Invalid, 10 Unknown, 0 Unchecked, 41.7s Time] [2024-09-11 19:34:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-09-11 19:34:38,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 136. [2024-09-11 19:34:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.0888888888888888) internal successors, (147), 135 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:34:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2024-09-11 19:34:38,761 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 119 [2024-09-11 19:34:38,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:34:38,764 INFO L474 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2024-09-11 19:34:38,764 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:34:38,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2024-09-11 19:34:38,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-09-11 19:34:38,766 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:34:38,766 INFO L216 NwaCegarLoop]: trace histogram [65, 55, 10, 1, 1, 1, 1, 1] [2024-09-11 19:34:38,786 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 19:34:38,966 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-11 19:34:38,967 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:34:38,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:34:38,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1219290264, now seen corresponding path program 7 times [2024-09-11 19:34:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:34:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709872627] [2024-09-11 19:34:38,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:34:38,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:34:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:34:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 1064 proven. 3080 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-09-11 19:34:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:34:41,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709872627] [2024-09-11 19:34:41,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709872627] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:34:41,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011352758] [2024-09-11 19:34:41,466 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-11 19:34:41,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:34:41,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:34:41,468 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-11 19:34:41,470 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-11 19:34:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:34:41,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 126 conjuncts are in the unsatisfiable core [2024-09-11 19:34:41,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:34:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 434 proven. 3782 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:34:42,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:34:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 434 proven. 3782 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:34:50,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011352758] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:34:50,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:34:50,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 63, 64] total 127 [2024-09-11 19:34:50,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015719186] [2024-09-11 19:34:50,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:34:50,147 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-09-11 19:34:50,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:34:50,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-09-11 19:34:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4279, Invalid=11977, Unknown=0, NotChecked=0, Total=16256 [2024-09-11 19:34:50,151 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 128 states, 128 states have (on average 2.0234375) internal successors, (259), 127 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)