./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.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 5189fb62 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-scaling/ps6-ll_valuebound10.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 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b --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-dev-5189fb6-m [2024-09-13 03:01:52,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 03:01:52,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 03:01:52,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 03:01:52,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 03:01:52,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 03:01:52,991 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 03:01:52,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 03:01:52,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 03:01:52,994 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 03:01:52,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 03:01:52,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 03:01:52,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 03:01:52,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 03:01:52,995 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 03:01:52,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 03:01:52,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 03:01:52,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 03:01:52,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 03:01:52,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 03:01:52,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 03:01:52,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 03:01:52,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 03:01:52,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 03:01:52,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 03:01:52,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 03:01:52,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 03:01:52,998 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 03:01:52,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 03:01:52,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 03:01:53,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 03:01:53,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 03:01:53,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:01:53,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 03:01:53,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 03:01:53,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 03:01:53,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 03:01:53,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 03:01:53,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 03:01:53,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 03:01:53,001 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 03:01:53,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 03:01:53,001 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 -> 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b 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-13 03:01:53,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 03:01:53,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 03:01:53,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 03:01:53,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 03:01:53,218 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 03:01:53,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2024-09-13 03:01:54,363 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 03:01:54,502 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 03:01:54,502 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2024-09-13 03:01:54,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ccd7cce7b/fbb2734ce28b4205807a4176fc200281/FLAGc2ceaee5b [2024-09-13 03:01:54,929 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ccd7cce7b/fbb2734ce28b4205807a4176fc200281 [2024-09-13 03:01:54,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 03:01:54,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 03:01:54,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 03:01:54,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 03:01:54,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 03:01:54,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:01:54" (1/1) ... [2024-09-13 03:01:54,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@358bf795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:54, skipping insertion in model container [2024-09-13 03:01:54,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:01:54" (1/1) ... [2024-09-13 03:01:54,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 03:01:55,054 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c[458,471] [2024-09-13 03:01:55,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:01:55,072 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 03:01:55,080 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c[458,471] [2024-09-13 03:01:55,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:01:55,097 INFO L204 MainTranslator]: Completed translation [2024-09-13 03:01:55,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55 WrapperNode [2024-09-13 03:01:55,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 03:01:55,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 03:01:55,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 03:01:55,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 03:01:55,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,120 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 03:01:55,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 03:01:55,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 03:01:55,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 03:01:55,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 03:01:55,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,137 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-13 03:01:55,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 03:01:55,146 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 03:01:55,146 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 03:01:55,146 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 03:01:55,147 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (1/1) ... [2024-09-13 03:01:55,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:01:55,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:01:55,175 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-13 03:01:55,177 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-13 03:01:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 03:01:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 03:01:55,211 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 03:01:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 03:01:55,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 03:01:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 03:01:55,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 03:01:55,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 03:01:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 03:01:55,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 03:01:55,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 03:01:55,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 03:01:55,260 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 03:01:55,261 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 03:01:55,388 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 03:01:55,388 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 03:01:55,411 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 03:01:55,412 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 03:01:55,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:01:55 BoogieIcfgContainer [2024-09-13 03:01:55,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 03:01:55,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 03:01:55,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 03:01:55,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 03:01:55,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 03:01:54" (1/3) ... [2024-09-13 03:01:55,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1603bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:01:55, skipping insertion in model container [2024-09-13 03:01:55,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:01:55" (2/3) ... [2024-09-13 03:01:55,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f1603bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:01:55, skipping insertion in model container [2024-09-13 03:01:55,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:01:55" (3/3) ... [2024-09-13 03:01:55,421 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2024-09-13 03:01:55,433 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 03:01:55,434 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 03:01:55,485 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 03:01:55,492 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;@59b37ea3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 03:01:55,493 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 03:01:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 03:01:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 03:01:55,502 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:01:55,503 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:01:55,503 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:01:55,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:01:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash -620791457, now seen corresponding path program 1 times [2024-09-13 03:01:55,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:01:55,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406544711] [2024-09-13 03:01:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:01:55,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:01:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:01:55,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:01:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:01:55,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:01:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:01:55,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 03:01:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:01:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:01:55,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:01:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406544711] [2024-09-13 03:01:55,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406544711] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:01:55,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:01:55,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 03:01:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486196872] [2024-09-13 03:01:55,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:01:55,675 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 03:01:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:01:55,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 03:01:55,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 03:01:55,696 INFO L87 Difference]: Start difference. First operand has 27 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 03:01:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:01:55,716 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2024-09-13 03:01:55,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 03:01:55,717 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-13 03:01:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:01:55,722 INFO L225 Difference]: With dead ends: 48 [2024-09-13 03:01:55,722 INFO L226 Difference]: Without dead ends: 23 [2024-09-13 03:01:55,724 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-13 03:01:55,727 INFO L434 NwaCegarLoop]: 28 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, 28 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-13 03:01:55,728 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 03:01:55,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-13 03:01:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-13 03:01:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 03:01:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-09-13 03:01:55,753 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2024-09-13 03:01:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:01:55,754 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-09-13 03:01:55,754 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 03:01:55,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:01:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-09-13 03:01:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-13 03:01:55,756 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:01:55,756 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:01:55,756 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 03:01:55,757 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:01:55,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:01:55,757 INFO L85 PathProgramCache]: Analyzing trace with hash -959298087, now seen corresponding path program 1 times [2024-09-13 03:01:55,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:01:55,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097477479] [2024-09-13 03:01:55,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:01:55,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:01:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 03:01:55,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016406786] [2024-09-13 03:01:55,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:01:55,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:01:55,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:01:55,784 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-13 03:01:55,786 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-13 03:01:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:01:55,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 03:01:55,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:01:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:01:55,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:01:55,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:01:55,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097477479] [2024-09-13 03:01:55,922 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 03:01:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016406786] [2024-09-13 03:01:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016406786] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:01:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:01:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 03:01:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705337665] [2024-09-13 03:01:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:01:55,924 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 03:01:55,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:01:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 03:01:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 03:01:55,926 INFO L87 Difference]: Start difference. First operand 23 states and 26 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 03:01:55,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:01:55,980 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-09-13 03:01:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 03:01:55,980 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-09-13 03:01:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:01:55,981 INFO L225 Difference]: With dead ends: 34 [2024-09-13 03:01:55,981 INFO L226 Difference]: Without dead ends: 30 [2024-09-13 03:01:55,982 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-13 03:01:55,983 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 77 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-13 03:01:55,984 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 03:01:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-13 03:01:55,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-13 03:01:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 03:01:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-13 03:01:55,993 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2024-09-13 03:01:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:01:55,993 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-13 03:01:55,993 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 03:01:55,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:01:55,994 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-13 03:01:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-13 03:01:55,995 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:01:55,995 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:01:56,007 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 03:01:56,196 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-13 03:01:56,196 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:01:56,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:01:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1544704875, now seen corresponding path program 1 times [2024-09-13 03:01:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:01:56,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502858606] [2024-09-13 03:01:56,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:01:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:01:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 03:01:56,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961942451] [2024-09-13 03:01:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:01:56,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:01:56,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:01:56,224 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-13 03:01:56,226 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-13 03:01:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:01:56,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 03:01:56,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:01:56,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:01:56,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:01:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 03:01:56,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:01:56,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502858606] [2024-09-13 03:01:56,431 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 03:01:56,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961942451] [2024-09-13 03:01:56,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961942451] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 03:01:56,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 03:01:56,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-13 03:01:56,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747586527] [2024-09-13 03:01:56,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:01:56,432 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 03:01:56,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:01:56,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 03:01:56,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 03:01:56,433 INFO L87 Difference]: Start difference. First operand 30 states and 33 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 03:01:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:01:56,470 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-09-13 03:01:56,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 03:01:56,470 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-13 03:01:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:01:56,471 INFO L225 Difference]: With dead ends: 36 [2024-09-13 03:01:56,471 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 03:01:56,472 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 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-13 03:01:56,473 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 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-13 03:01:56,473 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 03:01:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 03:01:56,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 03:01:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 03:01:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-09-13 03:01:56,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2024-09-13 03:01:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:01:56,482 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-09-13 03:01:56,482 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 03:01:56,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:01:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-09-13 03:01:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 03:01:56,483 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:01:56,483 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:01:56,494 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-13 03:01:56,687 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-13 03:01:56,687 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:01:56,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:01:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash 21814286, now seen corresponding path program 1 times [2024-09-13 03:01:56,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:01:56,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895866564] [2024-09-13 03:01:56,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:01:56,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:01:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 03:01:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791384085] [2024-09-13 03:01:56,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:01:56,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:01:56,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:01:56,718 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-13 03:01:56,719 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-13 03:01:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:01:56,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-13 03:01:56,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:01:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-13 03:01:56,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:01:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-13 03:01:57,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:01:57,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895866564] [2024-09-13 03:01:57,312 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 03:01:57,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791384085] [2024-09-13 03:01:57,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791384085] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:01:57,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:01:57,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-09-13 03:01:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31183347] [2024-09-13 03:01:57,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:01:57,313 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-13 03:01:57,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:01:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-13 03:01:57,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-09-13 03:01:57,315 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-13 03:01:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:01:57,563 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2024-09-13 03:01:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 03:01:57,564 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 39 [2024-09-13 03:01:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:01:57,565 INFO L225 Difference]: With dead ends: 53 [2024-09-13 03:01:57,565 INFO L226 Difference]: Without dead ends: 45 [2024-09-13 03:01:57,565 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-09-13 03:01:57,566 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:01:57,566 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 178 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:01:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-13 03:01:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-13 03:01:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-13 03:01:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-09-13 03:01:57,585 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 39 [2024-09-13 03:01:57,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:01:57,585 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-09-13 03:01:57,586 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 9 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-13 03:01:57,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:01:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-09-13 03:01:57,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-13 03:01:57,590 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:01:57,593 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:01:57,608 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 03:01:57,793 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-13 03:01:57,794 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:01:57,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:01:57,794 INFO L85 PathProgramCache]: Analyzing trace with hash -244405920, now seen corresponding path program 2 times [2024-09-13 03:01:57,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:01:57,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391440507] [2024-09-13 03:01:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:01:57,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:01:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 03:01:57,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1091023014] [2024-09-13 03:01:57,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 03:01:57,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:01:57,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:01:57,854 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-13 03:01:57,859 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-13 03:01:57,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 03:01:57,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:01:57,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-13 03:01:57,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:01:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 31 proven. 38 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-09-13 03:01:58,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:03:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 26 proven. 31 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-09-13 03:03:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:03:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391440507] [2024-09-13 03:03:32,791 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 03:03:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091023014] [2024-09-13 03:03:32,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091023014] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:03:32,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:03:32,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 27 [2024-09-13 03:03:32,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761428329] [2024-09-13 03:03:32,792 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:03:32,792 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-13 03:03:32,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:03:32,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-13 03:03:32,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=593, Unknown=4, NotChecked=0, Total=702 [2024-09-13 03:03:32,793 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-13 03:04:13,213 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 03:05:08,633 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 03:05:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:05:08,762 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2024-09-13 03:05:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-13 03:05:08,763 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) Word has length 60 [2024-09-13 03:05:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:05:08,764 INFO L225 Difference]: With dead ends: 74 [2024-09-13 03:05:08,764 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 03:05:08,765 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 157.9s TimeCoverageRelationStatistics Valid=246, Invalid=1304, Unknown=10, NotChecked=0, Total=1560 [2024-09-13 03:05:08,765 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:05:08,765 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 304 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:05:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 03:05:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-09-13 03:05:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 16 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-13 03:05:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-09-13 03:05:08,789 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 60 [2024-09-13 03:05:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:05:08,789 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-09-13 03:05:08,790 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 21 states have internal predecessors, (43), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-13 03:05:08,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:05:08,790 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-09-13 03:05:08,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-09-13 03:05:08,791 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:05:08,791 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:05:08,804 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 03:05:08,992 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-13 03:05:08,992 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:05:08,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:05:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash -235169010, now seen corresponding path program 3 times [2024-09-13 03:05:08,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:05:08,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446140163] [2024-09-13 03:05:08,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:05:08,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:05:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 03:05:09,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103868868] [2024-09-13 03:05:09,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 03:05:09,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:05:09,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:05:09,055 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-13 03:05:09,055 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-13 03:05:09,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-13 03:05:09,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:05:09,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-13 03:05:09,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:05:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 45 proven. 142 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-09-13 03:05:09,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:05:17,636 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ c_main_~y~0 .cse0) (+ 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-13 03:05:25,667 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-13 03:05:37,679 WARN L293 SmtUtils]: Spent 8.00s 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-13 03:05:49,689 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 03:05:57,707 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~c~0_BEFORE_CALL_26 Int) (v_main_~y~0_BEFORE_CALL_39 Int)) (let ((.cse0 (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39))) (or (= (+ (* v_main_~y~0_BEFORE_CALL_39 v_main_~c~0_BEFORE_CALL_26) v_main_~c~0_BEFORE_CALL_26) (+ v_main_~y~0_BEFORE_CALL_39 .cse0)) (= (mod (+ (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 6) (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 10) (* 7 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39) .cse0) 12) 0))))) is different from true [2024-09-13 03:06:09,724 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 03:06:25,777 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 03:06:33,800 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~c~0_BEFORE_CALL_26 Int) (v_main_~y~0_BEFORE_CALL_39 Int)) (let ((.cse0 (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39))) (or (= (+ (* v_main_~y~0_BEFORE_CALL_39 v_main_~c~0_BEFORE_CALL_26) v_main_~c~0_BEFORE_CALL_26) (+ v_main_~y~0_BEFORE_CALL_39 .cse0)) (= (mod (+ (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 6) (* v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 10) (* 7 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39 v_main_~y~0_BEFORE_CALL_39) .cse0) 12) 0)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-13 03:06:45,827 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 2 c_main_~y~0) .cse0) (+ (* 2 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-13 03:07:01,926 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (= (+ (* 3 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)) (+ (* 3 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-13 03:07:18,007 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (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)) (= (+ (* c_main_~c~0 4) (* c_main_~c~0 c_main_~y~0)) (+ (* 4 c_main_~y~0) .cse0)))) is different from false [2024-09-13 03:07:34,083 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_main_~y~0 c_main_~y~0))) (or (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)) (= (+ (* 5 c_main_~y~0) .cse0) (+ (* 5 c_main_~c~0) (* c_main_~c~0 c_main_~y~0))))) is different from false [2024-09-13 03:07:50,190 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-13 03:08:06,435 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-13 03:08:22,488 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-13 03:08:38,531 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-13 03:08:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 45 proven. 1 refuted. 6 times theorem prover too weak. 194 trivial. 135 not checked. [2024-09-13 03:08:46,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:08:46,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446140163] [2024-09-13 03:08:46,614 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 03:08:46,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103868868] [2024-09-13 03:08:46,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103868868] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:08:46,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:08:46,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2024-09-13 03:08:46,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846584234] [2024-09-13 03:08:46,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:08:46,615 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-13 03:08:46,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:08:46,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-13 03:08:46,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=375, Unknown=11, NotChecked=528, Total=992 [2024-09-13 03:08:46,616 INFO L87 Difference]: Start difference. First operand 64 states and 72 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, (28), 3 states have call predecessors, (28), 3 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-09-13 03:08:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:08:47,054 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-09-13 03:08:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-13 03:08:47,055 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, (28), 3 states have call predecessors, (28), 3 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) Word has length 95 [2024-09-13 03:08:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:08:47,056 INFO L225 Difference]: With dead ends: 81 [2024-09-13 03:08:47,056 INFO L226 Difference]: Without dead ends: 73 [2024-09-13 03:08:47,058 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=144, Invalid=881, Unknown=11, NotChecked=770, Total=1806 [2024-09-13 03:08:47,059 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 606 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:08:47,059 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 689 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 395 Invalid, 0 Unknown, 606 Unchecked, 0.2s Time] [2024-09-13 03:08:47,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-13 03:08:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-09-13 03:08:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 19 states have call successors, (19), 8 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-13 03:08:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2024-09-13 03:08:47,085 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 95 [2024-09-13 03:08:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:08:47,085 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2024-09-13 03:08:47,085 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, (28), 3 states have call predecessors, (28), 3 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-09-13 03:08:47,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:08:47,086 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2024-09-13 03:08:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-09-13 03:08:47,087 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:08:47,087 INFO L216 NwaCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:08:47,101 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 03:08:47,287 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-13 03:08:47,287 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:08:47,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:08:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1614984608, now seen corresponding path program 4 times [2024-09-13 03:08:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:08:47,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739202306] [2024-09-13 03:08:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:08:47,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:08:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:08:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 03:08:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 03:08:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-13 03:08:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-13 03:08:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 03:08:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-13 03:08:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 03:08:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-13 03:08:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,829 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-13 03:08:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-13 03:08:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-13 03:08:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-13 03:08:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-13 03:08:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-13 03:08:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-13 03:08:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-09-13 03:08:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:08:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 229 proven. 36 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-09-13 03:08:47,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:08:47,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739202306] [2024-09-13 03:08:47,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739202306] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:08:47,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429573319] [2024-09-13 03:08:47,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 03:08:47,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:08:47,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:08:47,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 03:08:47,858 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-13 03:08:47,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 03:08:47,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:08:47,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-13 03:08:47,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:08:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 354 proven. 3 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2024-09-13 03:08:48,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:08:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 262 proven. 3 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2024-09-13 03:08:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429573319] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:08:48,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:08:48,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 43 [2024-09-13 03:08:48,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105055001] [2024-09-13 03:08:48,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:08:48,519 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-09-13 03:08:48,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:08:48,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-09-13 03:08:48,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=1237, Unknown=0, NotChecked=0, Total=1806 [2024-09-13 03:08:48,520 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 41 states have internal predecessors, (95), 40 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (45), 40 states have call predecessors, (45), 40 states have call successors, (45) [2024-09-13 03:08:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:08:48,644 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2024-09-13 03:08:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-13 03:08:48,645 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 41 states have internal predecessors, (95), 40 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (45), 40 states have call predecessors, (45), 40 states have call successors, (45) Word has length 116 [2024-09-13 03:08:48,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:08:48,646 INFO L225 Difference]: With dead ends: 79 [2024-09-13 03:08:48,646 INFO L226 Difference]: Without dead ends: 0 [2024-09-13 03:08:48,647 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=574, Invalid=1318, Unknown=0, NotChecked=0, Total=1892 [2024-09-13 03:08:48,647 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:08:48,647 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 267 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:08:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-13 03:08:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-13 03:08:48,648 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-13 03:08:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-13 03:08:48,648 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2024-09-13 03:08:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:08:48,648 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-13 03:08:48,649 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 41 states have internal predecessors, (95), 40 states have call successors, (46), 2 states have call predecessors, (46), 3 states have return successors, (45), 40 states have call predecessors, (45), 40 states have call successors, (45) [2024-09-13 03:08:48,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:08:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-13 03:08:48,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-13 03:08:48,651 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-13 03:08:48,667 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-13 03:08:48,852 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:08:48,854 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-09-13 03:08:48,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-13 03:08:51,242 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-13 03:08:51,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.09 03:08:51 BoogieIcfgContainer [2024-09-13 03:08:51,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-13 03:08:51,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-13 03:08:51,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-13 03:08:51,259 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-13 03:08:51,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:01:55" (3/4) ... [2024-09-13 03:08:51,260 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-13 03:08:51,263 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-13 03:08:51,264 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-13 03:08:51,264 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-13 03:08:51,264 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-13 03:08:51,267 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-13 03:08:51,267 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-13 03:08:51,267 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-13 03:08:51,268 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-13 03:08:51,345 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-13 03:08:51,345 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-13 03:08:51,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-13 03:08:51,346 INFO L158 Benchmark]: Toolchain (without parser) took 416413.76ms. Allocated memory was 161.5MB in the beginning and 211.8MB in the end (delta: 50.3MB). Free memory was 134.2MB in the beginning and 67.8MB in the end (delta: 66.5MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. [2024-09-13 03:08:51,346 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 161.5MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 03:08:51,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.82ms. Allocated memory is still 161.5MB. Free memory was 134.2MB in the beginning and 122.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-13 03:08:51,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.02ms. Allocated memory is still 161.5MB. Free memory was 122.3MB in the beginning and 120.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 03:08:51,346 INFO L158 Benchmark]: Boogie Preprocessor took 24.63ms. Allocated memory is still 161.5MB. Free memory was 120.9MB in the beginning and 119.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 03:08:51,347 INFO L158 Benchmark]: RCFGBuilder took 267.04ms. Allocated memory is still 161.5MB. Free memory was 119.6MB in the beginning and 106.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 03:08:51,347 INFO L158 Benchmark]: TraceAbstraction took 415843.42ms. Allocated memory was 161.5MB in the beginning and 211.8MB in the end (delta: 50.3MB). Free memory was 105.5MB in the beginning and 72.0MB in the end (delta: 33.6MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2024-09-13 03:08:51,347 INFO L158 Benchmark]: Witness Printer took 86.90ms. Allocated memory is still 211.8MB. Free memory was 72.0MB in the beginning and 67.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-13 03:08:51,349 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.15ms. Allocated memory is still 161.5MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.82ms. Allocated memory is still 161.5MB. Free memory was 134.2MB in the beginning and 122.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.02ms. Allocated memory is still 161.5MB. Free memory was 122.3MB in the beginning and 120.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.63ms. Allocated memory is still 161.5MB. Free memory was 120.9MB in the beginning and 119.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 267.04ms. Allocated memory is still 161.5MB. Free memory was 119.6MB in the beginning and 106.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 415843.42ms. Allocated memory was 161.5MB in the beginning and 211.8MB in the end (delta: 50.3MB). Free memory was 105.5MB in the beginning and 72.0MB in the end (delta: 33.6MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. * Witness Printer took 86.90ms. Allocated memory is still 211.8MB. Free memory was 72.0MB in the beginning and 67.8MB 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 413.4s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 97.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 1616 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 606 IncrementalHoareTripleChecker+Unchecked, 1421 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1058 IncrementalHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 195 mSDtfsCounter, 1058 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 785 GetRequests, 630 SyntacticMatches, 8 SemanticMatches, 147 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1093 ImplicationChecksByTransitivity, 203.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=6, InterpolantAutomatonStates: 85, 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, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 314.4s InterpolantComputationTime, 739 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 821 ConstructedInterpolants, 3 QuantifiedInterpolants, 4983 SizeOfPredicates, 13 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 2529/2938 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: 28]: Loop Invariant Derived loop invariant: ((((((((((((((x == 33) && (y == 2)) && (k <= 10)) && (c == 2)) && (2 < k)) || (((((k <= 10) && (1 < k)) && (y == 1)) && (x == 1)) && (c == 1))) || (((((k <= 10) && (276 == x)) && (y == 3)) && (3 < k)) && (c == 3))) || (((((y == 6) && (k <= 10)) && (x == 12201)) && (c == 6)) && (6 < k))) || (((((k <= 10) && (4425 == x)) && (5 < k)) && (5 == c)) && (5 == y))) || (((((7 < k) && (7 == y)) && (k <= 10)) && (7 == c)) && (x == 29008))) || (((((k <= 10) && (y == 8)) && (c == 8)) && (8 < k)) && (x == 61776))) || (((((k <= 10) && (4 <= k)) && (y == 4)) && (c == 4)) && (1300 == x))) || (((((k <= 10) && (0 <= k)) && (((__int128) y * y) == ((__int128) k * y))) && ((c + ((__int128) c * y)) == (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))))) || (((((120825 == x) && (k <= 10)) && (y == 9)) && (9 <= k)) && (c == 9))) - 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-13 03:08:51,419 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE