./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c506323d3bd63f7e6137c28fc1be825d2491f66f4e75ccbab60530df37ca16f1 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:29:57,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:29:57,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:29:57,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:29:57,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:29:57,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:29:57,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:29:57,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:29:57,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:29:57,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:29:57,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:29:57,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:29:57,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:29:57,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:29:57,859 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:29:57,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:29:57,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:29:57,862 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:29:57,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:29:57,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:29:57,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:29:57,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:29:57,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:29:57,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:29:57,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:29:57,866 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:29:57,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:29:57,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:29:57,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:29:57,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:29:57,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:29:57,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:29:57,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:29:57,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:29:57,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:29:57,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:29:57,869 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:29:57,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:29:57,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:29:57,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:29:57,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:29:57,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:29:57,872 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c506323d3bd63f7e6137c28fc1be825d2491f66f4e75ccbab60530df37ca16f1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:29:58,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:29:58,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:29:58,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:29:58,241 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:29:58,241 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:29:58,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2024-09-25 10:29:59,779 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:29:59,974 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:29:59,975 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c [2024-09-25 10:29:59,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/573cdba50/d5b4c443f7364143b4de73007984837c/FLAG7a29cc883 [2024-09-25 10:29:59,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/573cdba50/d5b4c443f7364143b4de73007984837c [2024-09-25 10:29:59,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:29:59,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:29:59,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:29:59,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:30:00,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:30:00,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:29:59" (1/1) ... [2024-09-25 10:30:00,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7abbec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00, skipping insertion in model container [2024-09-25 10:30:00,004 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:29:59" (1/1) ... [2024-09-25 10:30:00,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:30:00,142 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c[319,332] [2024-09-25 10:30:00,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:30:00,173 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:30:00,184 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_11.c[319,332] [2024-09-25 10:30:00,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:30:00,207 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:30:00,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00 WrapperNode [2024-09-25 10:30:00,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:30:00,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:30:00,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:30:00,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:30:00,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,238 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:30:00,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:30:00,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:30:00,239 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:30:00,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:30:00,249 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,263 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:30:00,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:30:00,280 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:30:00,280 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:30:00,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:30:00,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (1/1) ... [2024-09-25 10:30:00,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:30:00,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:00,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:30:00,319 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:30:00,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:30:00,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:30:00,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:30:00,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:30:00,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:30:00,366 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:30:00,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:30:00,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:30:00,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:30:00,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:30:00,429 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:30:00,432 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:30:00,557 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-25 10:30:00,558 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:30:00,586 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:30:00,587 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:30:00,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:30:00 BoogieIcfgContainer [2024-09-25 10:30:00,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:30:00,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:30:00,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:30:00,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:30:00,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:29:59" (1/3) ... [2024-09-25 10:30:00,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35291c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:30:00, skipping insertion in model container [2024-09-25 10:30:00,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:30:00" (2/3) ... [2024-09-25 10:30:00,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35291c76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:30:00, skipping insertion in model container [2024-09-25 10:30:00,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:30:00" (3/3) ... [2024-09-25 10:30:00,597 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_11.c [2024-09-25 10:30:00,614 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:30:00,615 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:30:00,674 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:30:00,681 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;@254ae03c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:30:00,687 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:30:00,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:30:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:30:00,696 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:00,697 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:00,697 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:00,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1957128844, now seen corresponding path program 1 times [2024-09-25 10:30:00,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:00,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333508525] [2024-09-25 10:30:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:00,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:00,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:00,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:00,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333508525] [2024-09-25 10:30:00,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333508525] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:30:00,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:30:00,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:30:00,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397172195] [2024-09-25 10:30:00,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:30:00,852 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:30:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:00,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:30:00,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:30:00,880 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:00,910 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-09-25 10:30:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:30:00,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 10:30:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:00,919 INFO L225 Difference]: With dead ends: 29 [2024-09-25 10:30:00,919 INFO L226 Difference]: Without dead ends: 12 [2024-09-25 10:30:00,921 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:30:00,925 INFO L434 NwaCegarLoop]: 17 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, 17 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:00,926 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:30:00,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-25 10:30:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-25 10:30:00,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-09-25 10:30:00,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-09-25 10:30:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:00,959 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-09-25 10:30:00,960 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:00,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-09-25 10:30:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:30:00,961 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:00,961 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:00,962 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:30:00,962 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:00,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:00,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1947893634, now seen corresponding path program 1 times [2024-09-25 10:30:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:00,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181340108] [2024-09-25 10:30:00,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:00,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:01,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181340108] [2024-09-25 10:30:01,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181340108] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:30:01,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:30:01,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:30:01,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938222536] [2024-09-25 10:30:01,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:30:01,096 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:30:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:01,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:30:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:30:01,098 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:01,131 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-09-25 10:30:01,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:30:01,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 10:30:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:01,133 INFO L225 Difference]: With dead ends: 21 [2024-09-25 10:30:01,133 INFO L226 Difference]: Without dead ends: 14 [2024-09-25 10:30:01,133 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:30:01,134 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:01,135 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:30:01,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-25 10:30:01,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-09-25 10:30:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-09-25 10:30:01,146 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2024-09-25 10:30:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:01,148 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-09-25 10:30:01,148 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:01,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-09-25 10:30:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 10:30:01,150 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:01,151 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:01,151 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:30:01,151 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:01,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash 365820639, now seen corresponding path program 1 times [2024-09-25 10:30:01,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:01,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016339859] [2024-09-25 10:30:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:01,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,334 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:01,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:01,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016339859] [2024-09-25 10:30:01,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016339859] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:01,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865629319] [2024-09-25 10:30:01,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:01,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:01,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:01,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:01,348 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:30:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-25 10:30:01,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:01,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:01,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865629319] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:01,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:01,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:30:01,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786275782] [2024-09-25 10:30:01,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:01,489 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:30:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:01,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:30:01,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:30:01,490 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:01,547 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-09-25 10:30:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:30:01,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-25 10:30:01,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:01,549 INFO L225 Difference]: With dead ends: 25 [2024-09-25 10:30:01,549 INFO L226 Difference]: Without dead ends: 18 [2024-09-25 10:30:01,549 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:30:01,550 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:01,551 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:30:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-25 10:30:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-09-25 10:30:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2024-09-25 10:30:01,556 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2024-09-25 10:30:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:01,556 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2024-09-25 10:30:01,557 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:01,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2024-09-25 10:30:01,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:30:01,558 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:01,558 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:01,575 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:30:01,762 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:01,763 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:01,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1989560599, now seen corresponding path program 1 times [2024-09-25 10:30:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:01,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226329782] [2024-09-25 10:30:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:01,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:01,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:01,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226329782] [2024-09-25 10:30:01,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226329782] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:01,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910088464] [2024-09-25 10:30:01,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:01,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:01,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:01,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:01,936 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:30:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:01,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 10:30:01,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:02,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:30:02,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910088464] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:02,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:02,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-09-25 10:30:02,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735777286] [2024-09-25 10:30:02,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:02,143 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:30:02,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:02,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:30:02,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:30:02,144 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:02,230 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-09-25 10:30:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:30:02,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:30:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:02,231 INFO L225 Difference]: With dead ends: 33 [2024-09-25 10:30:02,231 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:30:02,232 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:30:02,232 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:02,233 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 54 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:30:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:30:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-09-25 10:30:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-09-25 10:30:02,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2024-09-25 10:30:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:02,245 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-09-25 10:30:02,245 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:02,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-09-25 10:30:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-25 10:30:02,246 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:02,246 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:02,267 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:30:02,450 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:02,451 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:02,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:02,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1675294028, now seen corresponding path program 2 times [2024-09-25 10:30:02,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:02,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879834940] [2024-09-25 10:30:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:02,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:02,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879834940] [2024-09-25 10:30:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879834940] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547497067] [2024-09-25 10:30:02,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:30:02,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:02,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:02,608 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:02,611 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:30:02,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:30:02,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:02,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:30:02,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:02,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:02,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:02,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547497067] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:02,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:02,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2024-09-25 10:30:02,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271729440] [2024-09-25 10:30:02,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:02,842 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 10:30:02,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:02,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 10:30:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:30:02,843 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:03,090 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-09-25 10:30:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 10:30:03,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-25 10:30:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:03,091 INFO L225 Difference]: With dead ends: 41 [2024-09-25 10:30:03,091 INFO L226 Difference]: Without dead ends: 31 [2024-09-25 10:30:03,092 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:30:03,094 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:03,095 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:30:03,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-25 10:30:03,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-25 10:30:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2024-09-25 10:30:03,109 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 18 [2024-09-25 10:30:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:03,109 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2024-09-25 10:30:03,110 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:03,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2024-09-25 10:30:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 10:30:03,112 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:03,112 INFO L216 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:03,129 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:30:03,312 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:03,313 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:03,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:03,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1980100574, now seen corresponding path program 3 times [2024-09-25 10:30:03,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:03,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896310606] [2024-09-25 10:30:03,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:03,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:03,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:03,591 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:30:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896310606] [2024-09-25 10:30:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896310606] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:03,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858906119] [2024-09-25 10:30:03,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:30:03,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:03,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:03,594 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:03,595 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:30:03,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 10:30:03,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:03,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:30:03,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-25 10:30:03,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-25 10:30:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858906119] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:03,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:03,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 16 [2024-09-25 10:30:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491994844] [2024-09-25 10:30:03,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:03,769 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 10:30:03,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:03,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 10:30:03,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-09-25 10:30:03,770 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:04,001 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2024-09-25 10:30:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 10:30:04,001 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-09-25 10:30:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:04,002 INFO L225 Difference]: With dead ends: 62 [2024-09-25 10:30:04,002 INFO L226 Difference]: Without dead ends: 52 [2024-09-25 10:30:04,003 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2024-09-25 10:30:04,004 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:04,004 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:30:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-25 10:30:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2024-09-25 10:30:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-25 10:30:04,023 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 30 [2024-09-25 10:30:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:04,023 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-25 10:30:04,023 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 16 states have internal predecessors, (37), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:04,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-25 10:30:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 10:30:04,025 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:04,025 INFO L216 NwaCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:04,048 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:30:04,232 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:04,233 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:04,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash -600183635, now seen corresponding path program 4 times [2024-09-25 10:30:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381708205] [2024-09-25 10:30:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:04,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:04,546 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:30:04,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:04,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381708205] [2024-09-25 10:30:04,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381708205] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:04,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876704060] [2024-09-25 10:30:04,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:30:04,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:04,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:04,555 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:04,557 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:30:04,595 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:30:04,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:04,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-25 10:30:04,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:30:04,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 182 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:30:05,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876704060] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:05,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:05,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 17] total 32 [2024-09-25 10:30:05,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564263561] [2024-09-25 10:30:05,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:05,362 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-25 10:30:05,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:05,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-25 10:30:05,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=693, Unknown=0, NotChecked=0, Total=992 [2024-09-25 10:30:05,366 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:16,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:30:16,117 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2024-09-25 10:30:16,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-25 10:30:16,117 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-09-25 10:30:16,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:30:16,119 INFO L225 Difference]: With dead ends: 89 [2024-09-25 10:30:16,120 INFO L226 Difference]: Without dead ends: 73 [2024-09-25 10:30:16,120 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=747, Invalid=1323, Unknown=0, NotChecked=0, Total=2070 [2024-09-25 10:30:16,121 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:30:16,122 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:30:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-25 10:30:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-09-25 10:30:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-09-25 10:30:16,144 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 40 [2024-09-25 10:30:16,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:30:16,144 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-09-25 10:30:16,144 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:16,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-09-25 10:30:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-25 10:30:16,146 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:30:16,146 INFO L216 NwaCegarLoop]: trace histogram [31, 27, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:30:16,161 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:30:16,351 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:30:16,351 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:30:16,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:30:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1482199165, now seen corresponding path program 5 times [2024-09-25 10:30:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:30:16,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998181258] [2024-09-25 10:30:16,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:30:16,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:30:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:17,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:30:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:30:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 196 proven. 756 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:30:17,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:30:17,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998181258] [2024-09-25 10:30:17,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998181258] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:30:17,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695618844] [2024-09-25 10:30:17,231 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:30:17,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:30:17,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:30:17,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:30:17,235 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:30:17,507 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-09-25 10:30:17,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:30:17,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-09-25 10:30:17,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:30:17,638 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 145 proven. 812 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:30:17,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:30:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 145 proven. 812 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:30:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695618844] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:30:19,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:30:19,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 32] total 62 [2024-09-25 10:30:19,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145735382] [2024-09-25 10:30:19,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:30:19,324 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-09-25 10:30:19,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:30:19,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-09-25 10:30:19,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1050, Invalid=2732, Unknown=0, NotChecked=0, Total=3782 [2024-09-25 10:30:19,327 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 62 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:30:42,408 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification. DAG size of input: 175 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:31:03,255 WARN L293 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 169 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:31:22,110 WARN L293 SmtUtils]: Spent 7.28s on a formula simplification. DAG size of input: 163 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:31:39,423 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 157 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:31:56,651 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 151 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:34:26,662 WARN L293 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 177 DAG size of output: 15 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-25 10:34:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:34:26,664 INFO L93 Difference]: Finished difference Result 151 states and 192 transitions. [2024-09-25 10:34:26,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-09-25 10:34:26,664 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 62 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-09-25 10:34:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:34:26,668 INFO L225 Difference]: With dead ends: 151 [2024-09-25 10:34:26,668 INFO L226 Difference]: Without dead ends: 135 [2024-09-25 10:34:26,670 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 248.4s TimeCoverageRelationStatistics Valid=2848, Invalid=5342, Unknown=0, NotChecked=0, Total=8190 [2024-09-25 10:34:26,671 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 1799 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:34:26,671 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1799 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-25 10:34:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-25 10:34:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-09-25 10:34:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 130 states have internal predecessors, (136), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:34:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2024-09-25 10:34:26,701 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 72 [2024-09-25 10:34:26,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:34:26,702 INFO L474 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2024-09-25 10:34:26,702 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.064516129032258) internal successors, (128), 62 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:34:26,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:34:26,702 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2024-09-25 10:34:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-09-25 10:34:26,705 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:34:26,705 INFO L216 NwaCegarLoop]: trace histogram [61, 57, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:34:26,719 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 10:34:26,906 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:34:26,906 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:34:26,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:34:26,907 INFO L85 PathProgramCache]: Analyzing trace with hash 659915043, now seen corresponding path program 6 times [2024-09-25 10:34:26,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:34:26,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573563583] [2024-09-25 10:34:26,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:34:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:34:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:29,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:34:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 406 proven. 3306 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-25 10:34:29,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:34:29,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573563583] [2024-09-25 10:34:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573563583] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:34:29,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490607812] [2024-09-25 10:34:29,237 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:34:29,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:34:29,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:34:29,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:34:29,240 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:34:29,351 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2024-09-25 10:34:29,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:34:29,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 10:34:29,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:34:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 513 proven. 16 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2024-09-25 10:34:29,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:34:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 513 proven. 14 refuted. 2 times theorem prover too weak. 3192 trivial. 0 not checked. [2024-09-25 10:34:34,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490607812] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:34:34,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:34:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 7, 8] total 71 [2024-09-25 10:34:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513826494] [2024-09-25 10:34:34,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:34:34,053 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-09-25 10:34:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:34:34,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-09-25 10:34:34,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=4182, Unknown=1, NotChecked=0, Total=4970 [2024-09-25 10:34:34,059 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand has 71 states, 71 states have (on average 2.0704225352112675) internal successors, (147), 71 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)