./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps5-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 04d6fb36 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps5-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 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 19:39:54,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 19:39:54,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 19:39:54,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 19:39:54,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 19:39:54,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 19:39:54,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 19:39:54,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 19:39:54,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 19:39:54,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 19:39:54,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 19:39:54,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 19:39:54,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 19:39:54,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 19:39:54,628 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 19:39:54,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 19:39:54,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 19:39:54,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 19:39:54,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 19:39:54,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 19:39:54,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 19:39:54,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 19:39:54,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 19:39:54,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 19:39:54,630 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 19:39:54,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 19:39:54,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 19:39:54,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 19:39:54,631 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 19:39:54,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 19:39:54,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 19:39:54,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 19:39:54,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:39:54,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 19:39:54,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 19:39:54,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 19:39:54,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 19:39:54,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 19:39:54,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 19:39:54,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 19:39:54,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 19:39:54,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 19:39:54,640 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 -> 4cd3813e1162515d6dfe6f021a67e8bd41b689ea28e27900ea441d7fd3bbe5cc Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-15 19:39:54,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 19:39:54,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 19:39:54,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 19:39:54,922 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 19:39:54,922 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 19:39:54,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2024-09-15 19:39:56,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 19:39:56,345 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 19:39:56,345 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c [2024-09-15 19:39:56,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/da4a0ff41/12d00688ec1e41378bc9b612a3e2bab8/FLAG37d136f35 [2024-09-15 19:39:56,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/da4a0ff41/12d00688ec1e41378bc9b612a3e2bab8 [2024-09-15 19:39:56,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 19:39:56,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 19:39:56,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 19:39:56,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 19:39:56,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 19:39:56,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fe6b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56, skipping insertion in model container [2024-09-15 19:39:56,374 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 19:39:56,524 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c[458,471] [2024-09-15 19:39:56,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:39:56,548 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 19:39:56,559 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps5-ll_valuebound10.c[458,471] [2024-09-15 19:39:56,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:39:56,581 INFO L204 MainTranslator]: Completed translation [2024-09-15 19:39:56,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56 WrapperNode [2024-09-15 19:39:56,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 19:39:56,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 19:39:56,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 19:39:56,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 19:39:56,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,599 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 19:39:56,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 19:39:56,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 19:39:56,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 19:39:56,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 19:39:56,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,622 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-15 19:39:56,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 19:39:56,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 19:39:56,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 19:39:56,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 19:39:56,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (1/1) ... [2024-09-15 19:39:56,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:39:56,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:39:56,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-15 19:39:56,664 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-15 19:39:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 19:39:56,712 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-15 19:39:56,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-15 19:39:56,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 19:39:56,712 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 19:39:56,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 19:39:56,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 19:39:56,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 19:39:56,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 19:39:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 19:39:56,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 19:39:56,715 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 19:39:56,770 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 19:39:56,772 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 19:39:56,888 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-15 19:39:56,889 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 19:39:56,908 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 19:39:56,908 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-15 19:39:56,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:39:56 BoogieIcfgContainer [2024-09-15 19:39:56,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 19:39:56,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 19:39:56,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 19:39:56,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 19:39:56,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:39:56" (1/3) ... [2024-09-15 19:39:56,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ad9c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:39:56, skipping insertion in model container [2024-09-15 19:39:56,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:39:56" (2/3) ... [2024-09-15 19:39:56,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66ad9c4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:39:56, skipping insertion in model container [2024-09-15 19:39:56,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:39:56" (3/3) ... [2024-09-15 19:39:56,916 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound10.c [2024-09-15 19:39:56,930 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 19:39:56,930 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-15 19:39:56,971 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 19:39:56,978 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;@7bc97a13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 19:39:56,979 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-15 19:39:56,982 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-15 19:39:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-15 19:39:56,989 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:39:56,990 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-15 19:39:56,990 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:39:56,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:39:56,996 INFO L85 PathProgramCache]: Analyzing trace with hash -620791457, now seen corresponding path program 1 times [2024-09-15 19:39:57,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:39:57,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174129622] [2024-09-15 19:39:57,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:39:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:39:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:39:57,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:39:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:39:57,127 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:39:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:39:57,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-15 19:39:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:39:57,150 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-15 19:39:57,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:39:57,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174129622] [2024-09-15 19:39:57,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174129622] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:39:57,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:39:57,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 19:39:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74649061] [2024-09-15 19:39:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:39:57,161 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-15 19:39:57,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:39:57,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-15 19:39:57,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 19:39:57,182 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-15 19:39:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:39:57,205 INFO L93 Difference]: Finished difference Result 48 states and 66 transitions. [2024-09-15 19:39:57,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-15 19:39:57,211 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-15 19:39:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:39:57,218 INFO L225 Difference]: With dead ends: 48 [2024-09-15 19:39:57,218 INFO L226 Difference]: Without dead ends: 23 [2024-09-15 19:39:57,221 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-15 19:39:57,224 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-15 19:39:57,224 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-15 19:39:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-15 19:39:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-15 19:39:57,255 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-15 19:39:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-09-15 19:39:57,258 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2024-09-15 19:39:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:39:57,260 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-09-15 19:39:57,260 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-15 19:39:57,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:39:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-09-15 19:39:57,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-15 19:39:57,264 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:39:57,264 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-15 19:39:57,264 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 19:39:57,264 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:39:57,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:39:57,265 INFO L85 PathProgramCache]: Analyzing trace with hash -959298087, now seen corresponding path program 1 times [2024-09-15 19:39:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:39:57,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747903405] [2024-09-15 19:39:57,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:39:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:39:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:39:57,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [61208491] [2024-09-15 19:39:57,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:39:57,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:39:57,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:39:57,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:39:57,313 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-15 19:39:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:39:57,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-15 19:39:57,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:39:57,488 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-15 19:39:57,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:39:57,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:39:57,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747903405] [2024-09-15 19:39:57,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:39:57,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61208491] [2024-09-15 19:39:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61208491] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:39:57,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:39:57,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:39:57,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50987034] [2024-09-15 19:39:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:39:57,491 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:39:57,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:39:57,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:39:57,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:39:57,493 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-15 19:39:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:39:57,550 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2024-09-15 19:39:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:39:57,550 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-15 19:39:57,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:39:57,551 INFO L225 Difference]: With dead ends: 34 [2024-09-15 19:39:57,551 INFO L226 Difference]: Without dead ends: 30 [2024-09-15 19:39:57,554 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-15 19:39:57,555 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-15 19:39:57,555 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-15 19:39:57,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-15 19:39:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-15 19:39:57,563 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-15 19:39:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-15 19:39:57,566 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2024-09-15 19:39:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:39:57,567 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-15 19:39:57,567 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-15 19:39:57,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:39:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-15 19:39:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-15 19:39:57,569 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:39:57,569 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-15 19:39:57,581 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-15 19:39:57,773 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:39:57,774 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:39:57,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:39:57,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1544704875, now seen corresponding path program 1 times [2024-09-15 19:39:57,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:39:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453593762] [2024-09-15 19:39:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:39:57,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:39:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:39:57,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [66999319] [2024-09-15 19:39:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:39:57,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:39:57,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:39:57,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:39:57,808 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-15 19:39:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:39:57,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-15 19:39:57,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:39:57,903 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-15 19:39:57,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:39:57,984 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-15 19:39:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:39:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453593762] [2024-09-15 19:39:57,985 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:39:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66999319] [2024-09-15 19:39:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66999319] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-15 19:39:57,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-15 19:39:57,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-15 19:39:57,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955021605] [2024-09-15 19:39:57,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:39:57,986 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:39:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:39:57,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:39:57,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-15 19:39:57,987 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-15 19:39:58,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:39:58,022 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-09-15 19:39:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:39:58,023 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-15 19:39:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:39:58,024 INFO L225 Difference]: With dead ends: 36 [2024-09-15 19:39:58,025 INFO L226 Difference]: Without dead ends: 32 [2024-09-15 19:39:58,025 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-15 19:39:58,026 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-15 19:39:58,027 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-15 19:39:58,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-15 19:39:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-15 19:39:58,036 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-15 19:39:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-09-15 19:39:58,037 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2024-09-15 19:39:58,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:39:58,038 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-09-15 19:39:58,038 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-15 19:39:58,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:39:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-09-15 19:39:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-15 19:39:58,039 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:39:58,039 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-15 19:39:58,051 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-15 19:39:58,243 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:39:58,244 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:39:58,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:39:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash 21814286, now seen corresponding path program 1 times [2024-09-15 19:39:58,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:39:58,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964551546] [2024-09-15 19:39:58,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:39:58,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:39:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:39:58,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940257204] [2024-09-15 19:39:58,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:39:58,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:39:58,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:39:58,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:39:58,275 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-15 19:39:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:39:58,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-15 19:39:58,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:39:58,429 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-15 19:39:58,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:39:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-15 19:39:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:39:58,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964551546] [2024-09-15 19:39:58,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:39:58,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940257204] [2024-09-15 19:39:58,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940257204] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:39:58,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:39:58,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-15 19:39:58,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053623754] [2024-09-15 19:39:58,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:39:58,538 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-15 19:39:58,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:39:58,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-15 19:39:58,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-15 19:39:58,540 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-15 19:39:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:39:58,636 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-09-15 19:39:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-15 19:39:58,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 39 [2024-09-15 19:39:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:39:58,637 INFO L225 Difference]: With dead ends: 49 [2024-09-15 19:39:58,637 INFO L226 Difference]: Without dead ends: 41 [2024-09-15 19:39:58,638 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-09-15 19:39:58,638 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:39:58,639 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 135 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:39:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-15 19:39:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-15 19:39:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-15 19:39:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-15 19:39:58,663 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 39 [2024-09-15 19:39:58,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:39:58,663 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-15 19:39:58,664 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-15 19:39:58,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:39:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-15 19:39:58,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-15 19:39:58,666 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:39:58,667 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-15 19:39:58,680 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-15 19:39:58,871 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:39:58,872 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:39:58,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:39:58,872 INFO L85 PathProgramCache]: Analyzing trace with hash -244405920, now seen corresponding path program 2 times [2024-09-15 19:39:58,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:39:58,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138891055] [2024-09-15 19:39:58,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:39:58,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:39:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:39:58,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305206931] [2024-09-15 19:39:58,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 19:39:58,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:39:58,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:39:58,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:39:58,929 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-15 19:39:58,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 19:39:58,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:39:58,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-15 19:39:58,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:39:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-09-15 19:39:59,170 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:39:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-15 19:39:59,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:39:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138891055] [2024-09-15 19:39:59,416 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:39:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305206931] [2024-09-15 19:39:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305206931] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:39:59,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:39:59,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-09-15 19:39:59,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361609213] [2024-09-15 19:39:59,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:39:59,417 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-15 19:39:59,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:39:59,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-15 19:39:59,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-09-15 19:39:59,418 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 13 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-15 19:39:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:39:59,862 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2024-09-15 19:39:59,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-15 19:39:59,863 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 13 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) Word has length 60 [2024-09-15 19:39:59,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:39:59,864 INFO L225 Difference]: With dead ends: 66 [2024-09-15 19:39:59,864 INFO L226 Difference]: Without dead ends: 58 [2024-09-15 19:39:59,864 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2024-09-15 19:39:59,865 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 19:39:59,865 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 387 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 19:39:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-15 19:39:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-09-15 19:39:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 16 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-15 19:39:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2024-09-15 19:39:59,903 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 60 [2024-09-15 19:39:59,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:39:59,904 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2024-09-15 19:39:59,904 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 13 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 14 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-15 19:39:59,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:39:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2024-09-15 19:39:59,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-09-15 19:39:59,909 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:39:59,909 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-15 19:39:59,922 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-15 19:40:00,112 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:40:00,113 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:40:00,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:40:00,113 INFO L85 PathProgramCache]: Analyzing trace with hash -235169010, now seen corresponding path program 3 times [2024-09-15 19:40:00,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:40:00,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345928307] [2024-09-15 19:40:00,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:40:00,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:40:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:40:00,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359494354] [2024-09-15 19:40:00,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-15 19:40:00,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:40:00,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:40:00,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:40:00,197 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-15 19:40:00,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-15 19:40:00,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:40:00,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-15 19:40:00,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:40:00,624 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 30 proven. 157 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-09-15 19:40:00,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:40:10,436 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* 6 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) (+ (* 6 c_main_~c~0) (* c_main_~c~0 c_main_~y~0))) (not (= (mod (+ (* 15 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 29 c_main_~y~0) (* 10 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)) 30) 0))) is different from false [2024-09-15 19:40:19,881 WARN L293 SmtUtils]: Spent 9.40s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:40:31,902 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:40:43,926 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:40:51,941 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~y~0_BEFORE_CALL_44 Int) (v_main_~c~0_BEFORE_CALL_31 Int)) (or (= (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~c~0_BEFORE_CALL_31) (* 6 v_main_~c~0_BEFORE_CALL_31)) (+ (* v_main_~y~0_BEFORE_CALL_44 6) (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44))) (= (mod (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 10) (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 15) (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 6) (* 29 v_main_~y~0_BEFORE_CALL_44)) 30) 0)))) is different from true [2024-09-15 19:41:04,459 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:41:20,685 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-15 19:41:28,697 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_main_~y~0_BEFORE_CALL_44 Int) (v_main_~c~0_BEFORE_CALL_31 Int)) (or (= (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~c~0_BEFORE_CALL_31) (* 6 v_main_~c~0_BEFORE_CALL_31)) (+ (* v_main_~y~0_BEFORE_CALL_44 6) (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44))) (= (mod (+ (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 10) (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 15) (* v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 v_main_~y~0_BEFORE_CALL_44 6) (* 29 v_main_~y~0_BEFORE_CALL_44)) 30) 0))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-15 19:41:41,501 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* 7 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)) (+ (* 7 c_main_~y~0) (* c_main_~y~0 c_main_~y~0))) (not (= (mod (+ (* 15 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 29 c_main_~y~0) (* 10 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)) 30) 0))) is different from false [2024-09-15 19:41:59,557 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* 8 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) (+ (* c_main_~c~0 8) (* c_main_~c~0 c_main_~y~0))) (not (= (mod (+ (* 15 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 29 c_main_~y~0) (* 10 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)) 30) 0))) is different from false [2024-09-15 19:42:15,619 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* 9 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) (+ (* c_main_~c~0 c_main_~y~0) (* 9 c_main_~c~0))) (not (= (mod (+ (* 15 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 29 c_main_~y~0) (* 10 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)) 30) 0))) is different from false [2024-09-15 19:42:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 30 proven. 51 refuted. 21 times theorem prover too weak. 194 trivial. 85 not checked. [2024-09-15 19:42:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:42:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345928307] [2024-09-15 19:42:23,668 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:42:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359494354] [2024-09-15 19:42:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359494354] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:42:23,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:42:23,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2024-09-15 19:42:23,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371820261] [2024-09-15 19:42:23,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:42:23,669 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-15 19:42:23,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:42:23,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-15 19:42:23,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=545, Unknown=6, NotChecked=318, Total=992 [2024-09-15 19:42:23,670 INFO L87 Difference]: Start difference. First operand 56 states and 66 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-15 19:42:24,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:42:24,195 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2024-09-15 19:42:24,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-15 19:42:24,196 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-15 19:42:24,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:42:24,197 INFO L225 Difference]: With dead ends: 61 [2024-09-15 19:42:24,197 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 19:42:24,198 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=239, Invalid=1111, Unknown=6, NotChecked=450, Total=1806 [2024-09-15 19:42:24,199 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 19:42:24,199 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 604 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 449 Invalid, 0 Unknown, 295 Unchecked, 0.3s Time] [2024-09-15 19:42:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 19:42:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 19:42:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 19:42:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 19:42:24,200 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2024-09-15 19:42:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:42:24,200 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 19:42:24,201 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-15 19:42:24,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:42:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 19:42:24,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 19:42:24,203 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-15 19:42:24,218 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-15 19:42:24,404 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-15 19:42:24,407 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-15 19:42:24,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-15 19:42:29,865 WARN L293 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 120 DAG size of output: 36 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-15 19:42:30,012 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 19:42:30,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:42:30 BoogieIcfgContainer [2024-09-15 19:42:30,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 19:42:30,032 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-15 19:42:30,032 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-15 19:42:30,032 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-15 19:42:30,033 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:39:56" (3/4) ... [2024-09-15 19:42:30,034 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-15 19:42:30,037 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-15 19:42:30,038 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-15 19:42:30,038 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-15 19:42:30,038 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-15 19:42:30,040 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-15 19:42:30,040 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-15 19:42:30,041 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-15 19:42:30,041 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 19:42:30,123 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-15 19:42:30,124 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-15 19:42:30,124 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-15 19:42:30,125 INFO L158 Benchmark]: Toolchain (without parser) took 153759.38ms. Allocated memory was 54.5MB in the beginning and 98.6MB in the end (delta: 44.0MB). Free memory was 24.0MB in the beginning and 41.4MB in the end (delta: -17.5MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-09-15 19:42:30,125 INFO L158 Benchmark]: CDTParser took 1.02ms. Allocated memory is still 41.9MB. Free memory was 25.5MB in the beginning and 25.5MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 19:42:30,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.29ms. Allocated memory is still 54.5MB. Free memory was 23.8MB in the beginning and 26.3MB in the end (delta: -2.5MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-09-15 19:42:30,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.24ms. Allocated memory is still 54.5MB. Free memory was 26.3MB in the beginning and 25.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 19:42:30,126 INFO L158 Benchmark]: Boogie Preprocessor took 28.93ms. Allocated memory is still 54.5MB. Free memory was 25.2MB in the beginning and 23.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 19:42:30,126 INFO L158 Benchmark]: RCFGBuilder took 277.73ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 23.5MB in the beginning and 37.5MB in the end (delta: -14.0MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-09-15 19:42:30,126 INFO L158 Benchmark]: TraceAbstraction took 153121.73ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 36.9MB in the beginning and 46.6MB in the end (delta: -9.7MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-09-15 19:42:30,126 INFO L158 Benchmark]: Witness Printer took 91.82ms. Allocated memory is still 98.6MB. Free memory was 46.6MB in the beginning and 41.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-15 19:42:30,128 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.02ms. Allocated memory is still 41.9MB. Free memory was 25.5MB in the beginning and 25.5MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.29ms. Allocated memory is still 54.5MB. Free memory was 23.8MB in the beginning and 26.3MB in the end (delta: -2.5MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.24ms. Allocated memory is still 54.5MB. Free memory was 26.3MB in the beginning and 25.2MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.93ms. Allocated memory is still 54.5MB. Free memory was 25.2MB in the beginning and 23.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 277.73ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 23.5MB in the beginning and 37.5MB in the end (delta: -14.0MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * TraceAbstraction took 153121.73ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 36.9MB in the beginning and 46.6MB in the end (delta: -9.7MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * Witness Printer took 91.82ms. Allocated memory is still 98.6MB. Free memory was 46.6MB in the beginning and 41.4MB in the end (delta: 5.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: 147.4s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 1304 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 295 IncrementalHoareTripleChecker+Unchecked, 1142 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 794 IncrementalHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 162 mSDtfsCounter, 794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 501 GetRequests, 401 SyntacticMatches, 8 SemanticMatches, 92 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 144.3s InterpolantComputationTime, 507 NumberOfCodeBlocks, 507 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 476 ConstructedInterpolants, 3 QuantifiedInterpolants, 2357 SizeOfPredicates, 10 NumberOfNonLiveVariables, 632 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 666/1048 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: (((((k <= 256) && ((c + ((__int128) c * y)) == (y + ((__int128) y * y)))) && ((((__int128) 5 * c) + ((__int128) c * y)) == (((__int128) 5 * y) + ((__int128) y * y)))) && ((y + ((__int128) 30 * x)) == (((((((__int128) y * y) * y) * y) * 15) + (6 * (((((__int128) y * y) * y) * y) * y))) + ((((__int128) y * y) * y) * 10)))) && ((c < k) || (((__int128) y * y) == ((__int128) k * y)))) - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-15 19:42:30,165 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