./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/ps6-ll.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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 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/nla-digbench/ps6-ll.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 07abfb6a25bc8999c03b9e73c88de3af15c2169770f93c7bfb47efae6a8a30d3 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 19:02:17,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 19:02:17,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 19:02:17,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 19:02:17,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 19:02:17,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 19:02:17,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 19:02:17,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 19:02:17,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 19:02:17,356 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 19:02:17,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 19:02:17,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 19:02:17,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 19:02:17,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 19:02:17,358 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 19:02:17,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 19:02:17,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 19:02:17,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 19:02:17,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 19:02:17,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 19:02:17,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 19:02:17,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 19:02:17,363 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 19:02:17,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 19:02:17,364 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 19:02:17,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 19:02:17,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 19:02:17,364 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 19:02:17,364 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 19:02:17,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 19:02:17,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 19:02:17,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 19:02:17,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:02:17,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 19:02:17,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 19:02:17,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 19:02:17,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 19:02:17,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 19:02:17,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 19:02:17,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 19:02:17,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 19:02:17,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 19:02:17,369 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 -> 07abfb6a25bc8999c03b9e73c88de3af15c2169770f93c7bfb47efae6a8a30d3 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 [2024-09-15 19:02:17,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 19:02:17,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 19:02:17,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 19:02:17,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 19:02:17,689 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 19:02:17,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench/ps6-ll.c [2024-09-15 19:02:19,042 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 19:02:19,183 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 19:02:19,184 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/ps6-ll.c [2024-09-15 19:02:19,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/212f8b2b1/8e1a11f7ee884e7081d5df8ddd9138d1/FLAG95ca136d7 [2024-09-15 19:02:19,206 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/212f8b2b1/8e1a11f7ee884e7081d5df8ddd9138d1 [2024-09-15 19:02:19,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 19:02:19,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 19:02:19,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 19:02:19,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 19:02:19,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 19:02:19,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6c6e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19, skipping insertion in model container [2024-09-15 19:02:19,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 19:02:19,378 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/ps6-ll.c[458,471] [2024-09-15 19:02:19,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:02:19,410 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 19:02:19,422 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/ps6-ll.c[458,471] [2024-09-15 19:02:19,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:02:19,450 INFO L204 MainTranslator]: Completed translation [2024-09-15 19:02:19,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19 WrapperNode [2024-09-15 19:02:19,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 19:02:19,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 19:02:19,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 19:02:19,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 19:02:19,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,470 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 19:02:19,471 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 19:02:19,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 19:02:19,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 19:02:19,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 19:02:19,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,500 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-15 19:02:19,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,502 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,505 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 19:02:19,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 19:02:19,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 19:02:19,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 19:02:19,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (1/1) ... [2024-09-15 19:02:19,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:02:19,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:02:19,548 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-15 19:02:19,555 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-15 19:02:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 19:02:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-15 19:02:19,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-15 19:02:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 19:02:19,597 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 19:02:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 19:02:19,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 19:02:19,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 19:02:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 19:02:19,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 19:02:19,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 19:02:19,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 19:02:19,648 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 19:02:19,650 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 19:02:19,851 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-15 19:02:19,852 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 19:02:19,883 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 19:02:19,884 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-15 19:02:19,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:02:19 BoogieIcfgContainer [2024-09-15 19:02:19,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 19:02:19,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 19:02:19,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 19:02:19,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 19:02:19,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:02:19" (1/3) ... [2024-09-15 19:02:19,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c579e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:02:19, skipping insertion in model container [2024-09-15 19:02:19,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:02:19" (2/3) ... [2024-09-15 19:02:19,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c579e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:02:19, skipping insertion in model container [2024-09-15 19:02:19,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:02:19" (3/3) ... [2024-09-15 19:02:19,895 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll.c [2024-09-15 19:02:19,913 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 19:02:19,914 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-15 19:02:19,963 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 19:02:19,968 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;@174b677f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 19:02:19,969 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-15 19:02:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-15 19:02:19,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 19:02:19,977 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:02:19,977 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:02:19,978 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:02:19,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1238311395, now seen corresponding path program 1 times [2024-09-15 19:02:19,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:02:19,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135953093] [2024-09-15 19:02:19,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:02:19,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:02:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:02:20,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:02:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:02:20,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:02:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:02:20,138 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-15 19:02:20,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:02:20,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135953093] [2024-09-15 19:02:20,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135953093] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:02:20,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:02:20,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 19:02:20,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512936586] [2024-09-15 19:02:20,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:02:20,145 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-15 19:02:20,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:02:20,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-15 19:02:20,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 19:02:20,175 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:02:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:02:20,198 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-09-15 19:02:20,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-15 19:02:20,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-15 19:02:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:02:20,208 INFO L225 Difference]: With dead ends: 44 [2024-09-15 19:02:20,208 INFO L226 Difference]: Without dead ends: 22 [2024-09-15 19:02:20,212 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-15 19:02:20,215 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:02:20,218 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:02:20,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-15 19:02:20,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-15 19:02:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 19:02:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-15 19:02:20,253 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2024-09-15 19:02:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:02:20,254 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-15 19:02:20,254 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:02:20,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-15 19:02:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 19:02:20,255 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:02:20,256 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:02:20,256 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 19:02:20,256 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:02:20,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1910922015, now seen corresponding path program 1 times [2024-09-15 19:02:20,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:02:20,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763162653] [2024-09-15 19:02:20,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:02:20,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:02:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:02:20,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228466470] [2024-09-15 19:02:20,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:02:20,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:02:20,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:02:20,300 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-15 19:02:20,303 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-15 19:02:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:02:20,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-15 19:02:20,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:02:20,444 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-15 19:02:20,444 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:02:20,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:02:20,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763162653] [2024-09-15 19:02:20,445 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:02:20,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228466470] [2024-09-15 19:02:20,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228466470] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:02:20,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:02:20,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:02:20,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634120849] [2024-09-15 19:02:20,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:02:20,446 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:02:20,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:02:20,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:02:20,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:02:20,451 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:02:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:02:20,503 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-15 19:02:20,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:02:20,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-15 19:02:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:02:20,505 INFO L225 Difference]: With dead ends: 33 [2024-09-15 19:02:20,505 INFO L226 Difference]: Without dead ends: 29 [2024-09-15 19:02:20,505 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-15 19:02:20,506 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:02:20,506 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:02:20,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-15 19:02:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-15 19:02:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-15 19:02:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-15 19:02:20,512 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 16 [2024-09-15 19:02:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:02:20,512 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-15 19:02:20,513 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:02:20,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:20,513 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-15 19:02:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-15 19:02:20,514 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:02:20,514 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:02:20,526 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-15 19:02:20,717 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:02:20,718 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:02:20,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 306700420, now seen corresponding path program 1 times [2024-09-15 19:02:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:02:20,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701207671] [2024-09-15 19:02:20,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:02:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:02:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:02:20,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42306108] [2024-09-15 19:02:20,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:02:20,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:02:20,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:02:20,743 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-15 19:02:20,744 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-15 19:02:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:02:20,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-15 19:02:20,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:02:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 19:02:20,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:02:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-15 19:02:20,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:02:20,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701207671] [2024-09-15 19:02:20,907 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:02:20,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42306108] [2024-09-15 19:02:20,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42306108] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-15 19:02:20,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-15 19:02:20,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-15 19:02:20,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506337421] [2024-09-15 19:02:20,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:02:20,909 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:02:20,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:02:20,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:02:20,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-15 19:02:20,910 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-15 19:02:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:02:20,963 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-09-15 19:02:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:02:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-15 19:02:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:02:20,964 INFO L225 Difference]: With dead ends: 35 [2024-09-15 19:02:20,965 INFO L226 Difference]: Without dead ends: 31 [2024-09-15 19:02:20,966 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-15 19:02:20,967 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:02:20,968 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:02:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-15 19:02:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-15 19:02:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-15 19:02:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-09-15 19:02:20,977 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2024-09-15 19:02:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:02:20,978 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-09-15 19:02:20,978 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-15 19:02:20,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-09-15 19:02:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-15 19:02:20,979 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:02:20,979 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:02:20,995 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-15 19:02:21,183 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:02:21,184 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:02:21,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1375311536, now seen corresponding path program 1 times [2024-09-15 19:02:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:02:21,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277884191] [2024-09-15 19:02:21,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:02:21,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:02:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:02:21,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525476098] [2024-09-15 19:02:21,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:02:21,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:02:21,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:02:21,222 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-15 19:02:21,222 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-15 19:02:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:02:21,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-15 19:02:21,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:02:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 19:02:21,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:02:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 19:02:21,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:02:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277884191] [2024-09-15 19:02:21,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:02:21,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525476098] [2024-09-15 19:02:21,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525476098] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:02:21,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:02:21,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-15 19:02:21,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492396299] [2024-09-15 19:02:21,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:02:21,502 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-15 19:02:21,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:02:21,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-15 19:02:21,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-15 19:02:21,502 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-15 19:02:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:02:21,696 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2024-09-15 19:02:21,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-15 19:02:21,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 34 [2024-09-15 19:02:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:02:21,698 INFO L225 Difference]: With dead ends: 48 [2024-09-15 19:02:21,698 INFO L226 Difference]: Without dead ends: 40 [2024-09-15 19:02:21,699 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-09-15 19:02:21,699 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:02:21,700 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 141 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:02:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-15 19:02:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-15 19:02:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 19:02:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-09-15 19:02:21,732 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 34 [2024-09-15 19:02:21,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:02:21,734 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-09-15 19:02:21,735 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-15 19:02:21,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-09-15 19:02:21,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-15 19:02:21,737 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:02:21,737 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:02:21,756 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-15 19:02:21,941 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:02:21,942 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:02:21,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1108147083, now seen corresponding path program 2 times [2024-09-15 19:02:21,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:02:21,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938759004] [2024-09-15 19:02:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:02:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:02:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:02:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218602449] [2024-09-15 19:02:21,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 19:02:21,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:02:21,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:02:21,974 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-15 19:02:21,975 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-15 19:02:22,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 19:02:22,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:02:22,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-15 19:02:22,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:02:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-15 19:02:22,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:02:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-15 19:02:22,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:02:22,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938759004] [2024-09-15 19:02:22,486 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:02:22,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218602449] [2024-09-15 19:02:22,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218602449] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:02:22,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:02:22,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-09-15 19:02:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717684653] [2024-09-15 19:02:22,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:02:22,487 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-15 19:02:22,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:02:22,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-15 19:02:22,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-09-15 19:02:22,488 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 13 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-15 19:02:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:02:22,889 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-09-15 19:02:22,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-15 19:02:22,890 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 13 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) Word has length 55 [2024-09-15 19:02:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:02:22,891 INFO L225 Difference]: With dead ends: 63 [2024-09-15 19:02:22,891 INFO L226 Difference]: Without dead ends: 55 [2024-09-15 19:02:22,892 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=761, Unknown=0, NotChecked=0, Total=930 [2024-09-15 19:02:22,892 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:02:22,893 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 305 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:02:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-15 19:02:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-15 19:02:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 15 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-15 19:02:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-09-15 19:02:22,914 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 55 [2024-09-15 19:02:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:02:22,915 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-09-15 19:02:22,915 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 13 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-15 19:02:22,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:22,915 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-09-15 19:02:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-15 19:02:22,917 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:02:22,917 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:02:22,931 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-15 19:02:23,121 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:02:23,122 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:02:23,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:02:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 639998000, now seen corresponding path program 3 times [2024-09-15 19:02:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:02:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963583540] [2024-09-15 19:02:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:02:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:02:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:02:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975468845] [2024-09-15 19:02:23,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-15 19:02:23,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:02:23,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:02:23,175 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-15 19:02:23,182 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-15 19:02:23,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-15 19:02:23,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:02:23,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-15 19:02:23,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:02:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 30 proven. 157 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-09-15 19:02:23,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:02:31,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 6 c_main_~y~0) .cse0) (+ (* 6 c_main_~c~0) (* c_main_~c~0 c_main_~y~0))) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-15 19:02:39,961 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:02:47,971 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:03:04,038 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:03:12,065 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~y~0_BEFORE_CALL_44 Int) (v_main_~c~0_BEFORE_CALL_31 Int)) (let ((.cse0 (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44))) (or (= (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~c~0_BEFORE_CALL_31) (* 6 v_main_~c~0_BEFORE_CALL_31)) (+ (* v_main_~y~0_BEFORE_CALL_44 6) .cse0)) (= 0 (mod (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 10) (* 7 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44) .cse0 (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 6)) 12)))))) is different from true [2024-09-15 19:03:24,520 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:03:40,551 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:03:48,575 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~y~0_BEFORE_CALL_44 Int) (v_main_~c~0_BEFORE_CALL_31 Int)) (let ((.cse0 (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44))) (or (= (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~c~0_BEFORE_CALL_31) (* 6 v_main_~c~0_BEFORE_CALL_31)) (+ (* v_main_~y~0_BEFORE_CALL_44 6) .cse0)) (= 0 (mod (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 10) (* 7 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44) .cse0 (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 6)) 12))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-15 19:03:57,658 WARN L293 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:04:01,670 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 7 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)) (+ (* 7 c_main_~y~0) .cse0)) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-15 19:04:17,741 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 8 c_main_~y~0) .cse0) (+ (* c_main_~c~0 8) (* c_main_~c~0 c_main_~y~0))) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-15 19:04:33,808 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 9 c_main_~y~0) .cse0) (+ (* c_main_~c~0 c_main_~y~0) (* 9 c_main_~c~0))) (not (= (mod (+ (* 10 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 7 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 6 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) .cse0) 12) 0)))) is different from false [2024-09-15 19:04:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 30 proven. 51 refuted. 21 times theorem prover too weak. 190 trivial. 85 not checked. [2024-09-15 19:04:41,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:04:41,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963583540] [2024-09-15 19:04:41,864 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:04:41,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975468845] [2024-09-15 19:04:41,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975468845] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:04:41,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:04:41,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2024-09-15 19:04:41,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388494306] [2024-09-15 19:04:41,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:04:41,870 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-15 19:04:41,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:04:41,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-15 19:04:41,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=545, Unknown=6, NotChecked=318, Total=992 [2024-09-15 19:04:41,871 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 32 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 23 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2024-09-15 19:04:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:04:42,420 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2024-09-15 19:04:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-15 19:04:42,421 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 23 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 90 [2024-09-15 19:04:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:04:42,422 INFO L225 Difference]: With dead ends: 60 [2024-09-15 19:04:42,422 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 19:04:42,423 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 149 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=239, Invalid=1111, Unknown=6, NotChecked=450, Total=1806 [2024-09-15 19:04:42,423 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 19:04:42,424 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 509 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 456 Invalid, 0 Unknown, 291 Unchecked, 0.3s Time] [2024-09-15 19:04:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 19:04:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 19:04:42,424 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-15 19:04:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 19:04:42,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2024-09-15 19:04:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:04:42,425 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 19:04:42,425 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.033333333333333) internal successors, (61), 30 states have internal predecessors, (61), 23 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2024-09-15 19:04:42,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:04:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 19:04:42,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 19:04:42,427 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-15 19:04:42,441 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-15 19:04:42,628 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-15 19:04:42,631 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-15 19:04:42,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-15 19:04:44,262 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 19:04:44,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:04:44 BoogieIcfgContainer [2024-09-15 19:04:44,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 19:04:44,277 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-15 19:04:44,277 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-15 19:04:44,277 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-15 19:04:44,277 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:02:19" (3/4) ... [2024-09-15 19:04:44,279 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-15 19:04:44,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-15 19:04:44,281 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-15 19:04:44,282 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-15 19:04:44,282 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-15 19:04:44,284 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-15 19:04:44,284 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-15 19:04:44,284 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-15 19:04:44,284 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 19:04:44,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-15 19:04:44,351 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-15 19:04:44,351 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-15 19:04:44,352 INFO L158 Benchmark]: Toolchain (without parser) took 145140.48ms. Allocated memory was 60.8MB in the beginning and 125.8MB in the end (delta: 65.0MB). Free memory was 32.0MB in the beginning and 65.9MB in the end (delta: -33.9MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-09-15 19:04:44,352 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 19:04:44,352 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.60ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 31.9MB in the beginning and 61.8MB in the end (delta: -29.9MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-09-15 19:04:44,352 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.59ms. Allocated memory is still 86.0MB. Free memory was 61.8MB in the beginning and 60.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 19:04:44,352 INFO L158 Benchmark]: Boogie Preprocessor took 38.33ms. Allocated memory is still 86.0MB. Free memory was 60.7MB in the beginning and 58.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 19:04:44,352 INFO L158 Benchmark]: RCFGBuilder took 374.90ms. Allocated memory is still 86.0MB. Free memory was 58.9MB in the beginning and 46.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-15 19:04:44,353 INFO L158 Benchmark]: TraceAbstraction took 144389.21ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 46.0MB in the beginning and 70.1MB in the end (delta: -24.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2024-09-15 19:04:44,353 INFO L158 Benchmark]: Witness Printer took 74.48ms. Allocated memory is still 125.8MB. Free memory was 70.1MB in the beginning and 65.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-15 19:04:44,356 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.21ms. Allocated memory is still 60.8MB. Free memory was 37.0MB in the beginning and 36.9MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.60ms. Allocated memory was 60.8MB in the beginning and 86.0MB in the end (delta: 25.2MB). Free memory was 31.9MB in the beginning and 61.8MB in the end (delta: -29.9MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.59ms. Allocated memory is still 86.0MB. Free memory was 61.8MB in the beginning and 60.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.33ms. Allocated memory is still 86.0MB. Free memory was 60.7MB in the beginning and 58.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 374.90ms. Allocated memory is still 86.0MB. Free memory was 58.9MB in the beginning and 46.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 144389.21ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 46.0MB in the beginning and 70.1MB in the end (delta: -24.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * Witness Printer took 74.48ms. Allocated memory is still 125.8MB. Free memory was 70.1MB in the beginning and 65.9MB 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: 12]: 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 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 142.7s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 1115 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 291 IncrementalHoareTripleChecker+Unchecked, 964 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 745 IncrementalHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 151 mSDtfsCounter, 745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 452 GetRequests, 353 SyntacticMatches, 8 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 25.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=5, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 139.6s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 426 ConstructedInterpolants, 3 QuantifiedInterpolants, 2374 SizeOfPredicates, 10 NumberOfNonLiveVariables, 587 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 626/1008 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: 27]: Loop Invariant Derived loop invariant: (((((k <= 256) && ((c + ((__int128) c * y)) == (y + ((__int128) y * y)))) && ((((__int128) 5 * c) + ((__int128) c * y)) == (((__int128) 5 * y) + ((__int128) y * y)))) && ((((2 * ((((((__int128) y * y) * y) * y) * y) * y)) + (6 * (((((__int128) y * y) * y) * y) * y))) + (5 * ((((__int128) y * y) * y) * y))) == (((__int128) x * 12) + ((__int128) y * y)))) && ((c < k) || (((__int128) y * y) == ((__int128) k * y)))) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 9]: 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-15 19:04:44,389 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE