./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/diamond_1-1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/diamond_1-1.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd9be28702be20fbd75b67eebfdc5f85895ff340c238c235c391c2a8578e7b23 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 17:55:01,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 17:55:01,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 17:55:01,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 17:55:01,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 17:55:01,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 17:55:01,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 17:55:01,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 17:55:01,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 17:55:01,426 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 17:55:01,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 17:55:01,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 17:55:01,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 17:55:01,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 17:55:01,428 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 17:55:01,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 17:55:01,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 17:55:01,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 17:55:01,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 17:55:01,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 17:55:01,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 17:55:01,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 17:55:01,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 17:55:01,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 17:55:01,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 17:55:01,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 17:55:01,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 17:55:01,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 17:55:01,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 17:55:01,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 17:55:01,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 17:55:01,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 17:55:01,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:55:01,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 17:55:01,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 17:55:01,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 17:55:01,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 17:55:01,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 17:55:01,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 17:55:01,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 17:55:01,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 17:55:01,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 17:55:01,435 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 -> bd9be28702be20fbd75b67eebfdc5f85895ff340c238c235c391c2a8578e7b23 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 17:55:01,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 17:55:01,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 17:55:01,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 17:55:01,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 17:55:01,718 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 17:55:01,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2024-09-12 17:55:03,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 17:55:03,240 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 17:55:03,241 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2024-09-12 17:55:03,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/fe5ada486/c8ca4cf4c83a4046b796f8e662069dd0/FLAG1a28555e5 [2024-09-12 17:55:03,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/fe5ada486/c8ca4cf4c83a4046b796f8e662069dd0 [2024-09-12 17:55:03,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 17:55:03,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 17:55:03,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 17:55:03,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 17:55:03,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 17:55:03,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a21b490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03, skipping insertion in model container [2024-09-12 17:55:03,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 17:55:03,822 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/diamond_1-1.c[373,386] [2024-09-12 17:55:03,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:55:03,850 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 17:55:03,860 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-acceleration/diamond_1-1.c[373,386] [2024-09-12 17:55:03,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:55:03,877 INFO L204 MainTranslator]: Completed translation [2024-09-12 17:55:03,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03 WrapperNode [2024-09-12 17:55:03,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 17:55:03,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 17:55:03,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 17:55:03,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 17:55:03,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,897 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 17:55:03,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 17:55:03,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 17:55:03,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 17:55:03,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 17:55:03,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,919 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 17:55:03,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 17:55:03,933 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 17:55:03,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 17:55:03,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 17:55:03,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (1/1) ... [2024-09-12 17:55:03,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:55:03,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:55:03,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 17:55:03,976 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 17:55:04,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 17:55:04,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 17:55:04,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 17:55:04,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 17:55:04,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 17:55:04,019 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 17:55:04,019 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 17:55:04,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 17:55:04,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 17:55:04,021 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 17:55:04,078 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 17:55:04,080 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 17:55:04,167 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-12 17:55:04,167 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 17:55:04,182 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 17:55:04,182 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 17:55:04,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:55:04 BoogieIcfgContainer [2024-09-12 17:55:04,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 17:55:04,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 17:55:04,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 17:55:04,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 17:55:04,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 05:55:03" (1/3) ... [2024-09-12 17:55:04,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22611d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:55:04, skipping insertion in model container [2024-09-12 17:55:04,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:55:03" (2/3) ... [2024-09-12 17:55:04,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22611d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:55:04, skipping insertion in model container [2024-09-12 17:55:04,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:55:04" (3/3) ... [2024-09-12 17:55:04,189 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2024-09-12 17:55:04,202 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 17:55:04,203 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 17:55:04,244 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 17:55:04,250 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;@75a1e143, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 17:55:04,251 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 17:55:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:55:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 17:55:04,265 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:04,266 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:04,266 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:04,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:04,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1330752012, now seen corresponding path program 1 times [2024-09-12 17:55:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:04,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463218997] [2024-09-12 17:55:04,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:04,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:04,377 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:04,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463218997] [2024-09-12 17:55:04,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463218997] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:04,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:55:04,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 17:55:04,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477749385] [2024-09-12 17:55:04,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:04,392 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 17:55:04,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 17:55:04,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 17:55:04,410 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:04,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:04,436 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-09-12 17:55:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 17:55:04,442 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 17:55:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:04,446 INFO L225 Difference]: With dead ends: 29 [2024-09-12 17:55:04,447 INFO L226 Difference]: Without dead ends: 12 [2024-09-12 17:55:04,449 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 17:55:04,451 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:04,452 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-12 17:55:04,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-12 17:55:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2024-09-12 17:55:04,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2024-09-12 17:55:04,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:04,476 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2024-09-12 17:55:04,476 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:04,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:04,477 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2024-09-12 17:55:04,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 17:55:04,478 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:04,478 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:04,478 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 17:55:04,478 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:04,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:04,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1321516802, now seen corresponding path program 1 times [2024-09-12 17:55:04,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:04,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249848872] [2024-09-12 17:55:04,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:04,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:04,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:04,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:04,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249848872] [2024-09-12 17:55:04,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249848872] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:04,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:55:04,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:55:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049290023] [2024-09-12 17:55:04,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:04,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 17:55:04,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:04,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 17:55:04,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:55:04,611 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:04,634 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-09-12 17:55:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 17:55:04,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 17:55:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:04,637 INFO L225 Difference]: With dead ends: 19 [2024-09-12 17:55:04,637 INFO L226 Difference]: Without dead ends: 14 [2024-09-12 17:55:04,638 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:55:04,638 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:04,639 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-12 17:55:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2024-09-12 17:55:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-09-12 17:55:04,646 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2024-09-12 17:55:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:04,646 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-09-12 17:55:04,646 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:04,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:04,647 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-09-12 17:55:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 17:55:04,647 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:04,647 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:04,647 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 17:55:04,647 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:04,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -257340833, now seen corresponding path program 1 times [2024-09-12 17:55:04,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:04,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453098593] [2024-09-12 17:55:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:04,780 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:04,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:04,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:04,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453098593] [2024-09-12 17:55:04,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453098593] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:55:04,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280369481] [2024-09-12 17:55:04,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:04,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:04,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:55:04,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:55:04,791 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 17:55:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:04,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 17:55:04,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:55:04,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:04,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:55:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:04,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280369481] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:55:04,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:55:04,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 17:55:04,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857904510] [2024-09-12 17:55:04,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:55:04,928 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:55:04,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:04,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:55:04,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:55:04,931 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:05,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:05,008 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2024-09-12 17:55:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:55:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-12 17:55:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:05,010 INFO L225 Difference]: With dead ends: 26 [2024-09-12 17:55:05,010 INFO L226 Difference]: Without dead ends: 21 [2024-09-12 17:55:05,011 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:55:05,012 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:05,013 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 23 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:05,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-12 17:55:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-09-12 17:55:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-09-12 17:55:05,022 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2024-09-12 17:55:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:05,022 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-09-12 17:55:05,023 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:05,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:05,024 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-09-12 17:55:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 17:55:05,024 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:05,024 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:05,037 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 17:55:05,228 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:05,229 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:05,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1209129206, now seen corresponding path program 2 times [2024-09-12 17:55:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531053096] [2024-09-12 17:55:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:05,415 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:05,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:05,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531053096] [2024-09-12 17:55:05,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531053096] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:55:05,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183886943] [2024-09-12 17:55:05,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:55:05,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:05,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:55:05,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:55:05,423 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 17:55:05,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 17:55:05,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:55:05,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 17:55:05,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:55:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:05,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:55:05,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:05,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183886943] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:55:05,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:55:05,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-12 17:55:05,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739795184] [2024-09-12 17:55:05,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:55:05,624 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-12 17:55:05,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:05,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-12 17:55:05,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-09-12 17:55:05,628 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-12 17:55:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:05,920 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2024-09-12 17:55:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 17:55:05,922 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-12 17:55:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:05,923 INFO L225 Difference]: With dead ends: 47 [2024-09-12 17:55:05,923 INFO L226 Difference]: Without dead ends: 42 [2024-09-12 17:55:05,923 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2024-09-12 17:55:05,924 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:05,924 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 44 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:55:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-12 17:55:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2024-09-12 17:55:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-09-12 17:55:05,938 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 18 [2024-09-12 17:55:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:05,938 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-09-12 17:55:05,938 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 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-12 17:55:05,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-09-12 17:55:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 17:55:05,939 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:05,939 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:05,952 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 17:55:06,140 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:06,141 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:06,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:06,141 INFO L85 PathProgramCache]: Analyzing trace with hash -481780085, now seen corresponding path program 1 times [2024-09-12 17:55:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627921711] [2024-09-12 17:55:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:06,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:06,178 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-12 17:55:06,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627921711] [2024-09-12 17:55:06,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627921711] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:06,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:55:06,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:55:06,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946938350] [2024-09-12 17:55:06,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:06,185 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 17:55:06,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:06,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 17:55:06,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:55:06,186 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:06,207 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2024-09-12 17:55:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 17:55:06,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 24 [2024-09-12 17:55:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:06,210 INFO L225 Difference]: With dead ends: 61 [2024-09-12 17:55:06,210 INFO L226 Difference]: Without dead ends: 45 [2024-09-12 17:55:06,211 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:55:06,212 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:06,212 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-12 17:55:06,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2024-09-12 17:55:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-09-12 17:55:06,233 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 24 [2024-09-12 17:55:06,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:06,234 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-09-12 17:55:06,234 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:06,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-09-12 17:55:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 17:55:06,235 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:06,236 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:06,236 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 17:55:06,236 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:06,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash 894051711, now seen corresponding path program 1 times [2024-09-12 17:55:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:06,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085503649] [2024-09-12 17:55:06,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:06,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:06,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:06,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:06,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085503649] [2024-09-12 17:55:06,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085503649] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:55:06,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424292214] [2024-09-12 17:55:06,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:06,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:06,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:55:06,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:55:06,393 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 17:55:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:06,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 17:55:06,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:55:06,476 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:06,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:55:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424292214] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:55:06,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:55:06,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-09-12 17:55:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894253676] [2024-09-12 17:55:06,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:55:06,655 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-12 17:55:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-12 17:55:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2024-09-12 17:55:06,656 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:07,443 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2024-09-12 17:55:07,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-12 17:55:07,444 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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 24 [2024-09-12 17:55:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:07,445 INFO L225 Difference]: With dead ends: 124 [2024-09-12 17:55:07,445 INFO L226 Difference]: Without dead ends: 119 [2024-09-12 17:55:07,446 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2024-09-12 17:55:07,449 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:07,449 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:55:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-09-12 17:55:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 62. [2024-09-12 17:55:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2024-09-12 17:55:07,480 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 24 [2024-09-12 17:55:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:07,481 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2024-09-12 17:55:07,481 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:07,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2024-09-12 17:55:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 17:55:07,482 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:07,482 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:07,496 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 17:55:07,682 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 17:55:07,683 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:07,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:07,683 INFO L85 PathProgramCache]: Analyzing trace with hash 846282340, now seen corresponding path program 3 times [2024-09-12 17:55:07,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:07,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99129299] [2024-09-12 17:55:07,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:07,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:07,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:07,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:07,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99129299] [2024-09-12 17:55:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99129299] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:55:07,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493851184] [2024-09-12 17:55:07,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 17:55:07,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:07,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:55:07,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:55:07,822 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 17:55:07,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-12 17:55:07,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:55:07,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 17:55:07,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:55:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:07,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:55:08,143 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:08,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493851184] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:55:08,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:55:08,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-09-12 17:55:08,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401177915] [2024-09-12 17:55:08,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:55:08,144 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-12 17:55:08,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:08,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-12 17:55:08,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2024-09-12 17:55:08,145 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:10,732 INFO L93 Difference]: Finished difference Result 206 states and 252 transitions. [2024-09-12 17:55:10,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 17:55:10,735 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 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-12 17:55:10,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:10,737 INFO L225 Difference]: With dead ends: 206 [2024-09-12 17:55:10,737 INFO L226 Difference]: Without dead ends: 201 [2024-09-12 17:55:10,737 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=440, Invalid=750, Unknown=0, NotChecked=0, Total=1190 [2024-09-12 17:55:10,738 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:10,738 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 93 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 17:55:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-09-12 17:55:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 86. [2024-09-12 17:55:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2024-09-12 17:55:10,772 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 30 [2024-09-12 17:55:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:10,775 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2024-09-12 17:55:10,775 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:10,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2024-09-12 17:55:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 17:55:10,776 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:10,777 INFO L216 NwaCegarLoop]: trace histogram [15, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:10,791 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 17:55:10,977 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:10,978 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:10,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:10,978 INFO L85 PathProgramCache]: Analyzing trace with hash 304315227, now seen corresponding path program 2 times [2024-09-12 17:55:10,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:10,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604501986] [2024-09-12 17:55:10,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:10,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:11,007 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-09-12 17:55:11,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:11,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604501986] [2024-09-12 17:55:11,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604501986] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:11,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:55:11,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:55:11,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17942415] [2024-09-12 17:55:11,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:11,011 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 17:55:11,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:11,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 17:55:11,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:55:11,012 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:11,043 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2024-09-12 17:55:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 17:55:11,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-09-12 17:55:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:11,045 INFO L225 Difference]: With dead ends: 119 [2024-09-12 17:55:11,045 INFO L226 Difference]: Without dead ends: 87 [2024-09-12 17:55:11,045 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:55:11,045 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:11,046 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:11,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-12 17:55:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-09-12 17:55:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.037037037037037) internal successors, (84), 81 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2024-09-12 17:55:11,066 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 40 [2024-09-12 17:55:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:11,066 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2024-09-12 17:55:11,066 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:11,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2024-09-12 17:55:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-12 17:55:11,067 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:11,067 INFO L216 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:11,068 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 17:55:11,068 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:11,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1116602702, now seen corresponding path program 2 times [2024-09-12 17:55:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:11,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114358963] [2024-09-12 17:55:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:11,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:11,351 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:11,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114358963] [2024-09-12 17:55:11,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114358963] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:55:11,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064946807] [2024-09-12 17:55:11,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:55:11,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:11,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:55:11,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:55:11,360 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 17:55:11,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 17:55:11,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:55:11,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-12 17:55:11,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:55:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:11,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:55:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:11,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064946807] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:55:11,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:55:11,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2024-09-12 17:55:11,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740460367] [2024-09-12 17:55:11,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:55:11,928 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-12 17:55:11,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:11,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-12 17:55:11,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2024-09-12 17:55:11,929 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:24,414 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2024-09-12 17:55:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-09-12 17:55:24,414 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 states have internal predecessors, (74), 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 42 [2024-09-12 17:55:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:24,415 INFO L225 Difference]: With dead ends: 127 [2024-09-12 17:55:24,415 INFO L226 Difference]: Without dead ends: 122 [2024-09-12 17:55:24,416 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=986, Invalid=1770, Unknown=0, NotChecked=0, Total=2756 [2024-09-12 17:55:24,416 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:24,416 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 17:55:24,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-12 17:55:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-09-12 17:55:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0256410256410255) internal successors, (120), 117 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2024-09-12 17:55:24,437 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 42 [2024-09-12 17:55:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:24,438 INFO L474 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2024-09-12 17:55:24,438 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:24,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2024-09-12 17:55:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 17:55:24,440 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:24,440 INFO L216 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:24,452 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 17:55:24,640 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:24,640 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:24,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:24,641 INFO L85 PathProgramCache]: Analyzing trace with hash 212822592, now seen corresponding path program 4 times [2024-09-12 17:55:24,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:24,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904124110] [2024-09-12 17:55:24,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:24,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:25,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904124110] [2024-09-12 17:55:25,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904124110] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:55:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684671429] [2024-09-12 17:55:25,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 17:55:25,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:25,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:55:25,024 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:55:25,025 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 17:55:25,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 17:55:25,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:55:25,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-09-12 17:55:25,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:55:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:25,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:55:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-09-12 17:55:25,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684671429] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:55:25,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:55:25,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27, 6] total 51 [2024-09-12 17:55:25,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825878130] [2024-09-12 17:55:25,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:55:25,882 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-09-12 17:55:25,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:25,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-09-12 17:55:25,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2320, Unknown=0, NotChecked=0, Total=2550 [2024-09-12 17:55:25,884 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:26,615 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2024-09-12 17:55:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-12 17:55:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 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 54 [2024-09-12 17:55:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:26,616 INFO L225 Difference]: With dead ends: 136 [2024-09-12 17:55:26,616 INFO L226 Difference]: Without dead ends: 81 [2024-09-12 17:55:26,617 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=334, Invalid=2636, Unknown=0, NotChecked=0, Total=2970 [2024-09-12 17:55:26,617 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 1809 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:26,617 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 97 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 17:55:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-12 17:55:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-09-12 17:55:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2024-09-12 17:55:26,648 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 54 [2024-09-12 17:55:26,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:26,648 INFO L474 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2024-09-12 17:55:26,649 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0) internal successors, (102), 50 states have internal predecessors, (102), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:26,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2024-09-12 17:55:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-09-12 17:55:26,650 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:55:26,650 INFO L216 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:55:26,662 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 17:55:26,851 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 17:55:26,852 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 17:55:26,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:26,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2097515736, now seen corresponding path program 3 times [2024-09-12 17:55:26,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:55:26,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409595456] [2024-09-12 17:55:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:55:26,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:55:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:27,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:55:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:55:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:55:27,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:55:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409595456] [2024-09-12 17:55:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409595456] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:55:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294574295] [2024-09-12 17:55:27,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 17:55:27,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:27,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:55:27,625 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 17:55:27,627 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-12 17:55:27,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-12 17:55:27,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:55:27,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-12 17:55:27,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:55:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2024-09-12 17:55:27,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 17:55:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294574295] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:55:27,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 17:55:27,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [37] total 42 [2024-09-12 17:55:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205392948] [2024-09-12 17:55:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:55:27,894 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 17:55:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:55:27,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 17:55:27,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1571, Unknown=0, NotChecked=0, Total=1722 [2024-09-12 17:55:27,895 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:27,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:55:27,991 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2024-09-12 17:55:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 17:55:27,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2024-09-12 17:55:27,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:55:27,992 INFO L225 Difference]: With dead ends: 79 [2024-09-12 17:55:27,992 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 17:55:27,993 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=1733, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 17:55:27,994 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:55:27,994 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:55:27,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 17:55:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 17:55:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 17:55:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 17:55:27,995 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2024-09-12 17:55:27,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:55:27,995 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 17:55:27,995 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:55:27,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:55:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 17:55:27,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 17:55:27,998 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 17:55:28,010 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 17:55:28,198 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:55:28,201 INFO L408 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1] [2024-09-12 17:55:28,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 17:55:29,808 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 17:55:29,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 05:55:29 BoogieIcfgContainer [2024-09-12 17:55:29,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 17:55:29,820 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 17:55:29,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 17:55:29,820 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 17:55:29,820 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:55:04" (3/4) ... [2024-09-12 17:55:29,822 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 17:55:29,824 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 17:55:29,825 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 17:55:29,825 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-12 17:55:29,827 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-09-12 17:55:29,827 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 17:55:29,827 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-12 17:55:29,827 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 17:55:29,892 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 17:55:29,892 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 17:55:29,892 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 17:55:29,893 INFO L158 Benchmark]: Toolchain (without parser) took 26236.15ms. Allocated memory was 62.9MB in the beginning and 144.7MB in the end (delta: 81.8MB). Free memory was 22.0MB in the beginning and 59.0MB in the end (delta: -36.9MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2024-09-12 17:55:29,893 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 62.9MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 17:55:29,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.80ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 21.8MB in the beginning and 53.6MB in the end (delta: -31.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-09-12 17:55:29,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.68ms. Allocated memory is still 81.8MB. Free memory was 53.6MB in the beginning and 52.7MB in the end (delta: 961.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 17:55:29,894 INFO L158 Benchmark]: Boogie Preprocessor took 34.15ms. Allocated memory is still 81.8MB. Free memory was 52.3MB in the beginning and 50.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 17:55:29,894 INFO L158 Benchmark]: RCFGBuilder took 249.69ms. Allocated memory is still 81.8MB. Free memory was 50.9MB in the beginning and 39.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 17:55:29,894 INFO L158 Benchmark]: TraceAbstraction took 25635.33ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 39.3MB in the beginning and 63.2MB in the end (delta: -23.8MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-09-12 17:55:29,894 INFO L158 Benchmark]: Witness Printer took 72.50ms. Allocated memory is still 144.7MB. Free memory was 63.2MB in the beginning and 59.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 17:55:29,895 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 62.9MB. Free memory was 34.5MB in the beginning and 34.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.80ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 21.8MB in the beginning and 53.6MB in the end (delta: -31.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.68ms. Allocated memory is still 81.8MB. Free memory was 53.6MB in the beginning and 52.7MB in the end (delta: 961.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.15ms. Allocated memory is still 81.8MB. Free memory was 52.3MB in the beginning and 50.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 249.69ms. Allocated memory is still 81.8MB. Free memory was 50.9MB in the beginning and 39.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25635.33ms. Allocated memory was 81.8MB in the beginning and 144.7MB in the end (delta: 62.9MB). Free memory was 39.3MB in the beginning and 63.2MB in the end (delta: -23.8MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 72.50ms. Allocated memory is still 144.7MB. Free memory was 63.2MB in the beginning and 59.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.0s, OverallIterations: 11, TraceHistogramMax: 34, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 557 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 299 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3465 IncrementalHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 299 mSolverCounterUnsat, 112 mSDtfsCounter, 3465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 631 GetRequests, 402 SyntacticMatches, 2 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=9, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 190 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 600 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 756 ConstructedInterpolants, 0 QuantifiedInterpolants, 2541 SizeOfPredicates, 3 NumberOfNonLiveVariables, 523 ConjunctsInSsa, 149 ConjunctsInUnsatCore, 24 InterpolantComputations, 5 PerfectInterpolantSequences, 1871/5304 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((((x + 4294967295) % 4294967296) <= 98) && (((y / 2) * 2) != y)) || (x == 0)) || (((y % 2) == 0) && ((x % 2) == 0))) - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-12 17:55:29,915 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE