./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.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_10.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 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 --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:29:12,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:29:12,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:29:12,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:29:12,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:29:12,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:29:12,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:29:12,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:29:12,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:29:12,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:29:12,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:29:12,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:29:12,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:29:12,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:29:12,626 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:29:12,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:29:12,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:29:12,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:29:12,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:29:12,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:29:12,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:29:12,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:29:12,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:29:12,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:29:12,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:29:12,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:29:12,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:29:12,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:29:12,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:29:12,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:29:12,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:29:12,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:29:12,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:29:12,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:29:12,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:29:12,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:29:12,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:29:12,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:29:12,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:29:12,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:29:12,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:29:12,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:29:12,635 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 -> 8c5f43b3e9ff1d4598a5a525fe9e716f863331c4c517b4b8adb0491943243286 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:29:12,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:29:12,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:29:12,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:29:12,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:29:12,938 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:29:12,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2024-09-11 19:29:14,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:29:14,488 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:29:14,489 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_10.c [2024-09-11 19:29:14,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/94b44c1bd/3969b73505c94e93b6fccdf8ef26637e/FLAG478adee8f [2024-09-11 19:29:14,879 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/94b44c1bd/3969b73505c94e93b6fccdf8ef26637e [2024-09-11 19:29:14,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:29:14,882 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:29:14,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:29:14,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:29:14,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:29:14,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:29:14" (1/1) ... [2024-09-11 19:29:14,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b789579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:14, skipping insertion in model container [2024-09-11 19:29:14,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:29:14" (1/1) ... [2024-09-11 19:29:14,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:29:15,037 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_10.c[319,332] [2024-09-11 19:29:15,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:29:15,057 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:29:15,071 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_10.c[319,332] [2024-09-11 19:29:15,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:29:15,092 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:29:15,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15 WrapperNode [2024-09-11 19:29:15,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:29:15,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:29:15,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:29:15,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:29:15,105 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:29:15" (1/1) ... [2024-09-11 19:29:15,112 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:29:15" (1/1) ... [2024-09-11 19:29:15,131 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2024-09-11 19:29:15,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:29:15,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:29:15,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:29:15,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:29:15,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (1/1) ... [2024-09-11 19:29:15,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (1/1) ... [2024-09-11 19:29:15,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (1/1) ... [2024-09-11 19:29:15,154 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:29:15,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (1/1) ... [2024-09-11 19:29:15,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (1/1) ... [2024-09-11 19:29:15,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (1/1) ... [2024-09-11 19:29:15,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (1/1) ... [2024-09-11 19:29:15,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (1/1) ... [2024-09-11 19:29:15,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (1/1) ... [2024-09-11 19:29:15,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:29:15,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:29:15,168 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:29:15,168 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:29:15,169 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (1/1) ... [2024-09-11 19:29:15,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:29:15,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:29:15,208 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:29:15,214 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:29:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:29:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:29:15,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:29:15,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:29:15,319 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:29:15,321 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:29:15,495 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-11 19:29:15,496 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:29:15,528 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:29:15,529 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 19:29:15,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:29:15 BoogieIcfgContainer [2024-09-11 19:29:15,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:29:15,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:29:15,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:29:15,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:29:15,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:29:14" (1/3) ... [2024-09-11 19:29:15,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96fc781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:29:15, skipping insertion in model container [2024-09-11 19:29:15,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:29:15" (2/3) ... [2024-09-11 19:29:15,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96fc781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:29:15, skipping insertion in model container [2024-09-11 19:29:15,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:29:15" (3/3) ... [2024-09-11 19:29:15,539 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_10.c [2024-09-11 19:29:15,554 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:29:15,554 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:29:15,613 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:29:15,621 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;@257de997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:29:15,621 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:29:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 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:29:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-11 19:29:15,630 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:29:15,631 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-11 19:29:15,632 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:29:15,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash 63417192, now seen corresponding path program 1 times [2024-09-11 19:29:15,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:29:15,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958802341] [2024-09-11 19:29:15,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:29:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:29:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:29:15,771 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:29:15,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:29:15,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958802341] [2024-09-11 19:29:15,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958802341] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:29:15,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:29:15,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:29:15,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457884705] [2024-09-11 19:29:15,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:29:15,778 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:29:15,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:29:15,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:29:15,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:29:15,800 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 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) 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:29:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:29:15,817 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2024-09-11 19:29:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:29:15,820 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:29:15,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:29:15,825 INFO L225 Difference]: With dead ends: 16 [2024-09-11 19:29:15,825 INFO L226 Difference]: Without dead ends: 8 [2024-09-11 19:29:15,827 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:29:15,830 INFO L434 NwaCegarLoop]: 9 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, 9 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:29:15,831 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:29:15,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2024-09-11 19:29:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2024-09-11 19:29:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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:29:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2024-09-11 19:29:15,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2024-09-11 19:29:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:29:15,857 INFO L474 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2024-09-11 19:29:15,857 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:29:15,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:15,858 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2024-09-11 19:29:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-11 19:29:15,859 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:29:15,859 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-11 19:29:15,859 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:29:15,859 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:29:15,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash 63089491, now seen corresponding path program 1 times [2024-09-11 19:29:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:29:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255090568] [2024-09-11 19:29:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:29:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:29:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:29:16,084 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:29:16,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:29:16,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255090568] [2024-09-11 19:29:16,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255090568] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:29:16,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:29:16,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:29:16,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343361024] [2024-09-11 19:29:16,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:29:16,088 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:29:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:29:16,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:29:16,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:29:16,089 INFO L87 Difference]: Start difference. First operand 8 states and 9 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:29:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:29:16,125 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2024-09-11 19:29:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:29:16,125 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:29:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:29:16,126 INFO L225 Difference]: With dead ends: 18 [2024-09-11 19:29:16,126 INFO L226 Difference]: Without dead ends: 11 [2024-09-11 19:29:16,126 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:29:16,127 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:29:16,128 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:29:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-09-11 19:29:16,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-09-11 19:29:16,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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:29:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2024-09-11 19:29:16,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2024-09-11 19:29:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:29:16,133 INFO L474 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2024-09-11 19:29:16,133 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:29:16,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2024-09-11 19:29:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 19:29:16,134 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:29:16,134 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:29:16,134 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:29:16,135 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:29:16,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash -100395752, now seen corresponding path program 1 times [2024-09-11 19:29:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:29:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052789443] [2024-09-11 19:29:16,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:29:16,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:29:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:29:16,397 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:29:16,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:29:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052789443] [2024-09-11 19:29:16,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052789443] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:29:16,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584866154] [2024-09-11 19:29:16,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:29:16,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:29:16,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:29:16,406 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:29:16,407 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:29:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:29:16,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 19:29:16,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:29:16,523 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:29:16,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:29:16,626 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:29:16,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584866154] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:29:16,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:29:16,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 8 [2024-09-11 19:29:16,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884578097] [2024-09-11 19:29:16,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:29:16,630 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 19:29:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:29:16,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 19:29:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:29:16,633 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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:29:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:29:16,724 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2024-09-11 19:29:16,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:29:16,725 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 8 [2024-09-11 19:29:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:29:16,726 INFO L225 Difference]: With dead ends: 25 [2024-09-11 19:29:16,726 INFO L226 Difference]: Without dead ends: 18 [2024-09-11 19:29:16,726 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:29:16,727 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:29:16,728 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 12 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:29:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-11 19:29:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-09-11 19:29:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:29:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-09-11 19:29:16,738 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 8 [2024-09-11 19:29:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:29:16,738 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-09-11 19:29:16,739 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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:29:16,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:16,740 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-09-11 19:29:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-11 19:29:16,741 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:29:16,741 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1] [2024-09-11 19:29:16,758 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:29:16,945 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:29:16,946 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:29:16,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:16,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1140498195, now seen corresponding path program 2 times [2024-09-11 19:29:16,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:29:16,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892255970] [2024-09-11 19:29:16,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:29:16,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:29:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:29:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:29:17,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:29:17,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892255970] [2024-09-11 19:29:17,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892255970] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:29:17,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747076386] [2024-09-11 19:29:17,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:29:17,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:29:17,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:29:17,325 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:29:17,327 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:29:17,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:29:17,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:29:17,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 19:29:17,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:29:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:29:17,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:29:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:29:17,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747076386] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:29:17,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:29:17,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2024-09-11 19:29:17,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005332272] [2024-09-11 19:29:17,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:29:17,652 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 19:29:17,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:29:17,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 19:29:17,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-09-11 19:29:17,654 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 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:29:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:29:18,038 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2024-09-11 19:29:18,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 19:29:18,039 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 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 17 [2024-09-11 19:29:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:29:18,040 INFO L225 Difference]: With dead ends: 45 [2024-09-11 19:29:18,040 INFO L226 Difference]: Without dead ends: 36 [2024-09-11 19:29:18,041 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=258, Unknown=0, NotChecked=0, Total=420 [2024-09-11 19:29:18,043 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 27 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:29:18,044 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 24 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:29:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-11 19:29:18,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-09-11 19:29:18,061 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:29:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-09-11 19:29:18,062 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 17 [2024-09-11 19:29:18,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:29:18,063 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-09-11 19:29:18,063 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 16 states have internal predecessors, (44), 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:29:18,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-09-11 19:29:18,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 19:29:18,066 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:29:18,066 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1] [2024-09-11 19:29:18,083 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:29:18,267 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:29:18,267 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:29:18,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1831092403, now seen corresponding path program 3 times [2024-09-11 19:29:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:29:18,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429696047] [2024-09-11 19:29:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:29:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:29:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:29:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:29:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:29:18,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429696047] [2024-09-11 19:29:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429696047] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:29:18,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971876825] [2024-09-11 19:29:18,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:29:18,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:29:18,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:29:18,793 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:29:18,794 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:29:18,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-11 19:29:18,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:29:18,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-11 19:29:18,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:29:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-09-11 19:29:18,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:29:18,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971876825] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:29:18,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:29:18,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 16 [2024-09-11 19:29:18,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349835934] [2024-09-11 19:29:18,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:29:18,979 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:29:18,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:29:18,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:29:18,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2024-09-11 19:29:18,981 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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:29:19,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:29:19,039 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2024-09-11 19:29:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:29:19,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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) Word has length 35 [2024-09-11 19:29:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:29:19,054 INFO L225 Difference]: With dead ends: 62 [2024-09-11 19:29:19,054 INFO L226 Difference]: Without dead ends: 58 [2024-09-11 19:29:19,055 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-09-11 19:29:19,055 INFO L434 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:29:19,056 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:29:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-11 19:29:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2024-09-11 19:29:19,068 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:29:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-09-11 19:29:19,069 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 35 [2024-09-11 19:29:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:29:19,069 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-09-11 19:29:19,069 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 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:29:19,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-09-11 19:29:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 19:29:19,071 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:29:19,071 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1] [2024-09-11 19:29:19,086 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:29:19,274 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:29:19,275 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:29:19,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1773834101, now seen corresponding path program 1 times [2024-09-11 19:29:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:29:19,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463806117] [2024-09-11 19:29:19,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:29:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:29:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:29:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:29:19,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:29:19,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463806117] [2024-09-11 19:29:19,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463806117] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:29:19,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561980098] [2024-09-11 19:29:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:29:19,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:29:19,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:29:19,455 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:29:19,456 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:29:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:29:19,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-11 19:29:19,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:29:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:29:19,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:29:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 19 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:29:20,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561980098] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:29:20,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:29:20,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 23 [2024-09-11 19:29:20,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960937887] [2024-09-11 19:29:20,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:29:20,022 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 19:29:20,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:29:20,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 19:29:20,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2024-09-11 19:29:20,023 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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:29:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:29:22,215 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2024-09-11 19:29:22,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 19:29:22,216 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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:29:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:29:22,218 INFO L225 Difference]: With dead ends: 87 [2024-09-11 19:29:22,218 INFO L226 Difference]: Without dead ends: 69 [2024-09-11 19:29:22,218 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=393, Invalid=663, Unknown=0, NotChecked=0, Total=1056 [2024-09-11 19:29:22,219 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 19:29:22,219 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 19:29:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-11 19:29:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-09-11 19:29:22,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 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:29:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2024-09-11 19:29:22,246 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 35 [2024-09-11 19:29:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:29:22,246 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2024-09-11 19:29:22,246 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 23 states have internal predecessors, (68), 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:29:22,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2024-09-11 19:29:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-11 19:29:22,248 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:29:22,248 INFO L216 NwaCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1, 1, 1] [2024-09-11 19:29:22,266 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 19:29:22,453 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:29:22,453 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:29:22,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:29:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1186010854, now seen corresponding path program 2 times [2024-09-11 19:29:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:29:22,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619047498] [2024-09-11 19:29:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:29:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:29:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:29:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:29:23,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:29:23,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619047498] [2024-09-11 19:29:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619047498] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:29:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230711775] [2024-09-11 19:29:23,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:29:23,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:29:23,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:29:23,030 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:29:23,031 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:29:23,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:29:23,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:29:23,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-11 19:29:23,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:29:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:29:23,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:29:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 41 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:29:24,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230711775] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:29:24,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:29:24,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 46 [2024-09-11 19:29:24,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726951264] [2024-09-11 19:29:24,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:29:24,393 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-09-11 19:29:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:29:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-09-11 19:29:24,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=1541, Unknown=0, NotChecked=0, Total=2162 [2024-09-11 19:29:24,395 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 47 states, 47 states have (on average 2.851063829787234) internal successors, (134), 46 states have internal predecessors, (134), 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:30:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:30:02,508 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2024-09-11 19:30:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-09-11 19:30:02,508 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.851063829787234) internal successors, (134), 46 states have internal predecessors, (134), 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 68 [2024-09-11 19:30:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:30:02,510 INFO L225 Difference]: With dead ends: 144 [2024-09-11 19:30:02,510 INFO L226 Difference]: Without dead ends: 135 [2024-09-11 19:30:02,511 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=1561, Invalid=2861, Unknown=0, NotChecked=0, Total=4422 [2024-09-11 19:30:02,512 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-11 19:30:02,512 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 51 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-11 19:30:02,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-11 19:30:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-09-11 19:30:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 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:30:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2024-09-11 19:30:02,557 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 68 [2024-09-11 19:30:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:30:02,557 INFO L474 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2024-09-11 19:30:02,558 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.851063829787234) internal successors, (134), 46 states have internal predecessors, (134), 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:30:02,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:30:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2024-09-11 19:30:02,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-09-11 19:30:02,565 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:30:02,565 INFO L216 NwaCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1, 1, 1] [2024-09-11 19:30:02,583 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 19:30:02,765 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:30:02,766 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:30:02,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:30:02,766 INFO L85 PathProgramCache]: Analyzing trace with hash 523367546, now seen corresponding path program 3 times [2024-09-11 19:30:02,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:30:02,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879614735] [2024-09-11 19:30:02,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:30:02,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:30:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:30:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 85 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:30:04,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:30:04,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879614735] [2024-09-11 19:30:04,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879614735] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:30:04,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318856315] [2024-09-11 19:30:04,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:30:04,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:30:04,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:30:04,332 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:30:04,333 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:30:04,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-11 19:30:04,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:30:04,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-11 19:30:04,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:30:04,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 125 proven. 85 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2024-09-11 19:30:04,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:30:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2542 trivial. 0 not checked. [2024-09-11 19:30:06,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318856315] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:30:06,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:30:06,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 6, 8] total 56 [2024-09-11 19:30:06,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122586443] [2024-09-11 19:30:06,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:30:06,939 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-09-11 19:30:06,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:30:06,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-09-11 19:30:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3014, Unknown=0, NotChecked=0, Total=3192 [2024-09-11 19:30:06,941 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand has 57 states, 57 states have (on average 2.736842105263158) internal successors, (156), 56 states have internal predecessors, (156), 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:30:13,951 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:30:14,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:30:14,579 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2024-09-11 19:30:14,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-09-11 19:30:14,581 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.736842105263158) internal successors, (156), 56 states have internal predecessors, (156), 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 134 [2024-09-11 19:30:14,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:30:14,582 INFO L225 Difference]: With dead ends: 167 [2024-09-11 19:30:14,582 INFO L226 Difference]: Without dead ends: 156 [2024-09-11 19:30:14,588 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=905, Invalid=9807, Unknown=0, NotChecked=0, Total=10712 [2024-09-11 19:30:14,589 INFO L434 NwaCegarLoop]: 2 mSDtfsCounter, 102 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6183 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 6183 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:30:14,590 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 77 Invalid, 6238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 6183 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2024-09-11 19:30:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-09-11 19:30:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 150. [2024-09-11 19:30:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 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:30:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2024-09-11 19:30:14,652 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 134 [2024-09-11 19:30:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:30:14,653 INFO L474 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2024-09-11 19:30:14,653 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.736842105263158) internal successors, (156), 56 states have internal predecessors, (156), 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:30:14,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:30:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2024-09-11 19:30:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-09-11 19:30:14,655 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:30:14,655 INFO L216 NwaCegarLoop]: trace histogram [48, 48, 44, 4, 1, 1, 1, 1, 1] [2024-09-11 19:30:14,673 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 19:30:14,855 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:30:14,856 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:30:14,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:30:14,857 INFO L85 PathProgramCache]: Analyzing trace with hash 26094035, now seen corresponding path program 4 times [2024-09-11 19:30:14,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:30:14,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103918383] [2024-09-11 19:30:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:30:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:30:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:30:16,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 491 proven. 2926 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 19:30:16,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:30:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103918383] [2024-09-11 19:30:16,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103918383] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:30:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310782216] [2024-09-11 19:30:16,608 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 19:30:16,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:30:16,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:30:16,609 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:30:16,610 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:30:16,738 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 19:30:16,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:30:16,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-09-11 19:30:16,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:30:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 491 proven. 2926 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 19:30:16,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:30:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 491 proven. 2926 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 19:30:19,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310782216] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:30:19,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:30:19,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 92 [2024-09-11 19:30:19,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201234712] [2024-09-11 19:30:19,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:30:19,874 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2024-09-11 19:30:19,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:30:19,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2024-09-11 19:30:19,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2298, Invalid=6258, Unknown=0, NotChecked=0, Total=8556 [2024-09-11 19:30:19,878 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand has 93 states, 93 states have (on average 3.010752688172043) internal successors, (280), 92 states have internal predecessors, (280), 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:30:39,620 WARN L293 SmtUtils]: Spent 17.57s on a formula simplification. DAG size of input: 182 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:31:05,685 WARN L293 SmtUtils]: Spent 21.82s on a formula simplification. DAG size of input: 178 DAG size of output: 14 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:31:25,072 WARN L293 SmtUtils]: Spent 11.02s on a formula simplification. DAG size of input: 174 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:31:53,185 WARN L293 SmtUtils]: Spent 15.81s on a formula simplification. DAG size of input: 170 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:32:20,160 WARN L293 SmtUtils]: Spent 10.36s on a formula simplification. DAG size of input: 166 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 19:32:50,891 WARN L293 SmtUtils]: Spent 9.91s on a formula simplification. DAG size of input: 162 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:24,063 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 158 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)