./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.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/hard2_valuebound100.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 c39f3d25be406fa166da46a61b4a36c0a90262202dfdee83ae8e5211f182a6f7 --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:29:39,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 19:29:39,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 19:29:39,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 19:29:39,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 19:29:39,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 19:29:39,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 19:29:39,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 19:29:39,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 19:29:39,677 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 19:29:39,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 19:29:39,678 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 19:29:39,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 19:29:39,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 19:29:39,679 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 19:29:39,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 19:29:39,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 19:29:39,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 19:29:39,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 19:29:39,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 19:29:39,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 19:29:39,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 19:29:39,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 19:29:39,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 19:29:39,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 19:29:39,682 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 19:29:39,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 19:29:39,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 19:29:39,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 19:29:39,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 19:29:39,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 19:29:39,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 19:29:39,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:29:39,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 19:29:39,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 19:29:39,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 19:29:39,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 19:29:39,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 19:29:39,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 19:29:39,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 19:29:39,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 19:29:39,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 19:29:39,686 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 -> c39f3d25be406fa166da46a61b4a36c0a90262202dfdee83ae8e5211f182a6f7 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:29:39,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 19:29:39,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 19:29:39,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 19:29:39,959 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 19:29:39,959 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 19:29:39,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c [2024-09-15 19:29:41,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 19:29:41,380 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 19:29:41,380 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c [2024-09-15 19:29:41,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b9c9bf7f9/547c0e0abf00495ca0fa1dbda8bd5e4d/FLAGb2f412abb [2024-09-15 19:29:41,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b9c9bf7f9/547c0e0abf00495ca0fa1dbda8bd5e4d [2024-09-15 19:29:41,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 19:29:41,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 19:29:41,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 19:29:41,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 19:29:41,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 19:29:41,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269c773f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41, skipping insertion in model container [2024-09-15 19:29:41,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 19:29:41,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/hard2_valuebound100.c[526,539] [2024-09-15 19:29:41,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:29:41,585 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 19:29:41,596 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/hard2_valuebound100.c[526,539] [2024-09-15 19:29:41,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:29:41,616 INFO L204 MainTranslator]: Completed translation [2024-09-15 19:29:41,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41 WrapperNode [2024-09-15 19:29:41,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 19:29:41,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 19:29:41,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 19:29:41,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 19:29:41,623 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:29:41" (1/1) ... [2024-09-15 19:29:41,628 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:29:41" (1/1) ... [2024-09-15 19:29:41,633 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 19:29:41,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 19:29:41,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 19:29:41,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 19:29:41,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 19:29:41,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,651 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,663 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-15 19:29:41,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,663 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 19:29:41,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 19:29:41,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 19:29:41,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 19:29:41,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (1/1) ... [2024-09-15 19:29:41,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:29:41,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:41,696 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:29:41,698 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:29:41,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 19:29:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-15 19:29:41,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-15 19:29:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 19:29:41,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 19:29:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 19:29:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-15 19:29:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 19:29:41,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 19:29:41,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 19:29:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 19:29:41,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 19:29:41,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 19:29:41,781 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 19:29:41,782 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 19:29:41,968 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-15 19:29:41,969 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 19:29:41,991 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 19:29:41,991 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-15 19:29:41,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:29:41 BoogieIcfgContainer [2024-09-15 19:29:41,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 19:29:41,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 19:29:41,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 19:29:41,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 19:29:41,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:29:41" (1/3) ... [2024-09-15 19:29:41,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bace53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:29:41, skipping insertion in model container [2024-09-15 19:29:41,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:29:41" (2/3) ... [2024-09-15 19:29:41,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bace53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:29:41, skipping insertion in model container [2024-09-15 19:29:41,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:29:41" (3/3) ... [2024-09-15 19:29:42,000 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound100.c [2024-09-15 19:29:42,013 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 19:29:42,013 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-15 19:29:42,063 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 19:29:42,068 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;@7565b255, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 19:29:42,069 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-15 19:29:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-15 19:29:42,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 19:29:42,078 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:42,078 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:42,079 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:42,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash -909137831, now seen corresponding path program 1 times [2024-09-15 19:29:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:42,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131517250] [2024-09-15 19:29:42,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:42,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 19:29:42,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:42,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131517250] [2024-09-15 19:29:42,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131517250] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:42,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:42,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 19:29:42,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208703817] [2024-09-15 19:29:42,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:42,214 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-15 19:29:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:42,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-15 19:29:42,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 19:29:42,230 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:29:42,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:42,252 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2024-09-15 19:29:42,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-15 19:29:42,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-15 19:29:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:42,258 INFO L225 Difference]: With dead ends: 58 [2024-09-15 19:29:42,259 INFO L226 Difference]: Without dead ends: 29 [2024-09-15 19:29:42,261 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 19:29:42,263 INFO L434 NwaCegarLoop]: 39 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, 39 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:29:42,264 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-15 19:29:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-15 19:29:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 19:29:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-09-15 19:29:42,288 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-09-15 19:29:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:42,289 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-09-15 19:29:42,289 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:29:42,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-09-15 19:29:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-15 19:29:42,291 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:42,292 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:42,292 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 19:29:42,293 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:42,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:42,293 INFO L85 PathProgramCache]: Analyzing trace with hash -229079461, now seen corresponding path program 1 times [2024-09-15 19:29:42,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:42,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757584335] [2024-09-15 19:29:42,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:42,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,442 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 19:29:42,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:42,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757584335] [2024-09-15 19:29:42,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757584335] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:42,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:42,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:29:42,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207044951] [2024-09-15 19:29:42,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:42,463 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:42,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:42,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:42,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:29:42,464 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:29:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:42,510 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-09-15 19:29:42,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:42,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-15 19:29:42,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:42,511 INFO L225 Difference]: With dead ends: 42 [2024-09-15 19:29:42,512 INFO L226 Difference]: Without dead ends: 40 [2024-09-15 19:29:42,512 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:29:42,513 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:42,513 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-15 19:29:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-09-15 19:29:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 19:29:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-09-15 19:29:42,527 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 16 [2024-09-15 19:29:42,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:42,527 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-09-15 19:29:42,528 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-15 19:29:42,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:42,528 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-09-15 19:29:42,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-15 19:29:42,529 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:42,529 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:42,529 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 19:29:42,530 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:42,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 520476838, now seen corresponding path program 1 times [2024-09-15 19:29:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:42,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460908622] [2024-09-15 19:29:42,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:42,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 19:29:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 19:29:42,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460908622] [2024-09-15 19:29:42,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460908622] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:42,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:42,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:29:42,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961279089] [2024-09-15 19:29:42,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:42,632 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:42,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:42,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:42,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:29:42,633 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-15 19:29:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:42,683 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-09-15 19:29:42,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:42,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-15 19:29:42,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:42,685 INFO L225 Difference]: With dead ends: 46 [2024-09-15 19:29:42,685 INFO L226 Difference]: Without dead ends: 44 [2024-09-15 19:29:42,685 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:29:42,686 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:42,686 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-15 19:29:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-09-15 19:29:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-15 19:29:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-15 19:29:42,692 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2024-09-15 19:29:42,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:42,693 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-15 19:29:42,693 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-15 19:29:42,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:42,693 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-15 19:29:42,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-15 19:29:42,694 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:42,694 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:42,694 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 19:29:42,694 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:42,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1140086011, now seen corresponding path program 1 times [2024-09-15 19:29:42,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:42,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780302717] [2024-09-15 19:29:42,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:42,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301565708] [2024-09-15 19:29:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:42,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:42,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:42,709 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:29:42,710 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:29:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:42,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-15 19:29:42,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-15 19:29:42,835 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:29:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780302717] [2024-09-15 19:29:42,836 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:29:42,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301565708] [2024-09-15 19:29:42,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301565708] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:42,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:42,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:29:42,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511324272] [2024-09-15 19:29:42,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:42,837 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:42,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:42,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:42,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:29:42,838 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:29:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:42,894 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-09-15 19:29:42,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:42,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 26 [2024-09-15 19:29:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:42,895 INFO L225 Difference]: With dead ends: 63 [2024-09-15 19:29:42,896 INFO L226 Difference]: Without dead ends: 50 [2024-09-15 19:29:42,896 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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:29:42,897 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:42,897 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:42,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-15 19:29:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-09-15 19:29:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-15 19:29:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-09-15 19:29:42,904 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 26 [2024-09-15 19:29:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:42,905 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-09-15 19:29:42,905 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:29:42,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-09-15 19:29:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-15 19:29:42,906 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:42,906 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:42,919 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:29:43,107 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:43,107 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:43,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash -975701997, now seen corresponding path program 1 times [2024-09-15 19:29:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:43,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010528790] [2024-09-15 19:29:43,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:43,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1795948197] [2024-09-15 19:29:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:43,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:43,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:43,121 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:29:43,122 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:29:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:43,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-15 19:29:43,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 19:29:43,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:29:43,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:43,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010528790] [2024-09-15 19:29:43,241 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:29:43,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795948197] [2024-09-15 19:29:43,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795948197] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:43,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:43,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:29:43,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546326669] [2024-09-15 19:29:43,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:43,241 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:43,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:43,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:43,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:29:43,242 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-15 19:29:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:43,304 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-09-15 19:29:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:43,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-15 19:29:43,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:43,305 INFO L225 Difference]: With dead ends: 63 [2024-09-15 19:29:43,305 INFO L226 Difference]: Without dead ends: 61 [2024-09-15 19:29:43,306 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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:29:43,306 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:43,307 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-15 19:29:43,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-09-15 19:29:43,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-15 19:29:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-09-15 19:29:43,333 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 33 [2024-09-15 19:29:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:43,334 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-09-15 19:29:43,334 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-15 19:29:43,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-09-15 19:29:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-15 19:29:43,335 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:43,335 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:43,348 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-15 19:29:43,535 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:43,536 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:43,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:43,536 INFO L85 PathProgramCache]: Analyzing trace with hash -928833564, now seen corresponding path program 1 times [2024-09-15 19:29:43,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:43,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217518159] [2024-09-15 19:29:43,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:43,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1297883356] [2024-09-15 19:29:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:43,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:43,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:43,552 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:29:43,553 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:29:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:43,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-15 19:29:43,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-15 19:29:43,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:29:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-15 19:29:43,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:43,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217518159] [2024-09-15 19:29:43,797 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:29:43,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297883356] [2024-09-15 19:29:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297883356] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-15 19:29:43,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-15 19:29:43,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-15 19:29:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476023458] [2024-09-15 19:29:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:43,800 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:43,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:43,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:43,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-15 19:29:43,800 INFO L87 Difference]: Start difference. First operand 60 states and 75 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-15 19:29:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:43,866 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-09-15 19:29:43,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:43,867 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2024-09-15 19:29:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:43,869 INFO L225 Difference]: With dead ends: 70 [2024-09-15 19:29:43,869 INFO L226 Difference]: Without dead ends: 68 [2024-09-15 19:29:43,869 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 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:29:43,870 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:43,870 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-15 19:29:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-09-15 19:29:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-15 19:29:43,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2024-09-15 19:29:43,883 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 43 [2024-09-15 19:29:43,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:43,884 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2024-09-15 19:29:43,884 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-15 19:29:43,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:43,884 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-09-15 19:29:43,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-15 19:29:43,885 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:43,887 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:43,902 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-15 19:29:44,091 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-15 19:29:44,092 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:44,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash -238148106, now seen corresponding path program 1 times [2024-09-15 19:29:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:44,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507939090] [2024-09-15 19:29:44,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:44,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:44,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:44,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 19:29:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:44,186 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-15 19:29:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:44,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-15 19:29:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:44,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-15 19:29:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:44,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-15 19:29:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:44,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-15 19:29:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-15 19:29:44,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:44,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507939090] [2024-09-15 19:29:44,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507939090] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:29:44,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:29:44,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 19:29:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626253598] [2024-09-15 19:29:44,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:29:44,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 19:29:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 19:29:44,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 19:29:44,222 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-15 19:29:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:44,266 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2024-09-15 19:29:44,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 19:29:44,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2024-09-15 19:29:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:44,270 INFO L225 Difference]: With dead ends: 75 [2024-09-15 19:29:44,270 INFO L226 Difference]: Without dead ends: 63 [2024-09-15 19:29:44,270 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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:29:44,270 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:44,271 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 123 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 19:29:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-15 19:29:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-15 19:29:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-15 19:29:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2024-09-15 19:29:44,290 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 49 [2024-09-15 19:29:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:44,290 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2024-09-15 19:29:44,290 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-15 19:29:44,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2024-09-15 19:29:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-15 19:29:44,291 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:44,291 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:44,291 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 19:29:44,291 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:44,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1374799408, now seen corresponding path program 1 times [2024-09-15 19:29:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390521241] [2024-09-15 19:29:44,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:44,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986241417] [2024-09-15 19:29:44,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:44,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:44,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:44,322 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:29:44,322 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:29:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:44,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-15 19:29:44,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:44,593 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-15 19:29:44,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:29:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-15 19:29:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:45,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390521241] [2024-09-15 19:29:45,667 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:29:45,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986241417] [2024-09-15 19:29:45,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986241417] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:29:45,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:29:45,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-09-15 19:29:45,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020450950] [2024-09-15 19:29:45,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:29:45,668 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-15 19:29:45,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:45,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-15 19:29:45,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-09-15 19:29:45,669 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-15 19:29:46,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:46,157 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2024-09-15 19:29:46,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-15 19:29:46,157 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 63 [2024-09-15 19:29:46,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:46,159 INFO L225 Difference]: With dead ends: 138 [2024-09-15 19:29:46,160 INFO L226 Difference]: Without dead ends: 115 [2024-09-15 19:29:46,161 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-09-15 19:29:46,161 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:46,162 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 225 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-15 19:29:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-09-15 19:29:46,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-09-15 19:29:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 71 states have internal predecessors, (80), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-09-15 19:29:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2024-09-15 19:29:46,198 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 63 [2024-09-15 19:29:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:46,198 INFO L474 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2024-09-15 19:29:46,198 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-15 19:29:46,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2024-09-15 19:29:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-15 19:29:46,201 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:46,201 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:46,214 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:29:46,401 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:46,402 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:46,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:46,402 INFO L85 PathProgramCache]: Analyzing trace with hash -2048390162, now seen corresponding path program 1 times [2024-09-15 19:29:46,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:46,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557740] [2024-09-15 19:29:46,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:46,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [15168235] [2024-09-15 19:29:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:46,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:46,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:46,422 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:29:46,424 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:29:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:46,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-15 19:29:46,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-15 19:29:46,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:29:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-15 19:29:47,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557740] [2024-09-15 19:29:47,041 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:29:47,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15168235] [2024-09-15 19:29:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15168235] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:29:47,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:29:47,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-09-15 19:29:47,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289537011] [2024-09-15 19:29:47,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:29:47,042 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-15 19:29:47,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:47,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-15 19:29:47,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-09-15 19:29:47,043 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-09-15 19:29:47,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:47,585 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2024-09-15 19:29:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-15 19:29:47,585 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 74 [2024-09-15 19:29:47,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:47,587 INFO L225 Difference]: With dead ends: 168 [2024-09-15 19:29:47,588 INFO L226 Difference]: Without dead ends: 136 [2024-09-15 19:29:47,589 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-09-15 19:29:47,589 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:47,590 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 195 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-15 19:29:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-09-15 19:29:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2024-09-15 19:29:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 70 states have internal predecessors, (76), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-09-15 19:29:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-09-15 19:29:47,619 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 74 [2024-09-15 19:29:47,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:47,621 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-09-15 19:29:47,621 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-09-15 19:29:47,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:47,621 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-09-15 19:29:47,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-15 19:29:47,622 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:47,622 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:47,635 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-15 19:29:47,826 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:47,827 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:47,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:47,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1556827571, now seen corresponding path program 1 times [2024-09-15 19:29:47,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:47,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787801748] [2024-09-15 19:29:47,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:47,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:29:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:29:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 19:29:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-15 19:29:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-15 19:29:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-15 19:29:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-15 19:29:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-15 19:29:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-15 19:29:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-15 19:29:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-15 19:29:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-15 19:29:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-15 19:29:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-15 19:29:48,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:29:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787801748] [2024-09-15 19:29:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787801748] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:29:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970087828] [2024-09-15 19:29:48,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:48,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:48,111 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:29:48,113 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-15 19:29:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:29:48,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-15 19:29:48,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-15 19:29:48,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:29:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-15 19:29:48,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970087828] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:29:48,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:29:48,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-15 19:29:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339988715] [2024-09-15 19:29:48,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:29:48,551 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-15 19:29:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:29:48,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-15 19:29:48,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-15 19:29:48,552 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2024-09-15 19:29:48,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:29:48,716 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2024-09-15 19:29:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-15 19:29:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) Word has length 79 [2024-09-15 19:29:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:29:48,718 INFO L225 Difference]: With dead ends: 129 [2024-09-15 19:29:48,718 INFO L226 Difference]: Without dead ends: 100 [2024-09-15 19:29:48,718 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-15 19:29:48,719 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:29:48,719 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 225 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:29:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-15 19:29:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-09-15 19:29:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-15 19:29:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2024-09-15 19:29:48,746 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 79 [2024-09-15 19:29:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:29:48,746 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2024-09-15 19:29:48,747 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2024-09-15 19:29:48,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2024-09-15 19:29:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-15 19:29:48,748 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:29:48,748 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:29:48,760 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-15 19:29:48,948 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-15 19:29:48,949 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:29:48,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:29:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash -802122381, now seen corresponding path program 2 times [2024-09-15 19:29:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:29:48,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541762340] [2024-09-15 19:29:48,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:29:48,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:29:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:29:48,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1249909316] [2024-09-15 19:29:48,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 19:29:48,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:29:48,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:29:48,975 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:29:48,976 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-15 19:29:49,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 19:29:49,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:29:49,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-15 19:29:49,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:29:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-15 19:29:49,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:30:04,313 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-15 19:30:04,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:30:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541762340] [2024-09-15 19:30:04,314 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:30:04,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249909316] [2024-09-15 19:30:04,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249909316] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:30:04,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:30:04,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2024-09-15 19:30:04,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457879516] [2024-09-15 19:30:04,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:30:04,315 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-15 19:30:04,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:30:04,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-15 19:30:04,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-09-15 19:30:04,316 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-09-15 19:30:16,823 WARN L293 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 171 DAG size of output: 83 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-15 19:30:18,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-15 19:30:19,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-15 19:30:36,751 WARN L293 SmtUtils]: Spent 11.23s on a formula simplification. DAG size of input: 156 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-15 19:30:37,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:30:37,830 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2024-09-15 19:30:37,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-15 19:30:37,830 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 93 [2024-09-15 19:30:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:30:37,832 INFO L225 Difference]: With dead ends: 203 [2024-09-15 19:30:37,832 INFO L226 Difference]: Without dead ends: 170 [2024-09-15 19:30:37,832 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 29.2s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2024-09-15 19:30:37,832 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 66 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-09-15 19:30:37,833 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 513 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-09-15 19:30:37,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-09-15 19:30:37,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2024-09-15 19:30:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 98 states have (on average 1.183673469387755) internal successors, (116), 105 states have internal predecessors, (116), 51 states have call successors, (51), 17 states have call predecessors, (51), 16 states have return successors, (49), 43 states have call predecessors, (49), 49 states have call successors, (49) [2024-09-15 19:30:37,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2024-09-15 19:30:37,879 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 93 [2024-09-15 19:30:37,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:30:37,879 INFO L474 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2024-09-15 19:30:37,879 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 states have internal predecessors, (46), 12 states have call successors, (31), 3 states have call predecessors, (31), 2 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2024-09-15 19:30:37,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2024-09-15 19:30:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-09-15 19:30:37,880 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:30:37,881 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:30:37,896 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-15 19:30:38,081 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:30:38,081 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:30:38,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:38,082 INFO L85 PathProgramCache]: Analyzing trace with hash 644553835, now seen corresponding path program 2 times [2024-09-15 19:30:38,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:30:38,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180440047] [2024-09-15 19:30:38,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:30:38,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:30:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:30:38,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190183996] [2024-09-15 19:30:38,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 19:30:38,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:30:38,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:30:38,117 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:30:38,118 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-15 19:30:38,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 19:30:38,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:30:38,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-09-15 19:30:38,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:30:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-15 19:30:38,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:30:41,448 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-15 19:30:41,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:30:41,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180440047] [2024-09-15 19:30:41,449 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:30:41,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190183996] [2024-09-15 19:30:41,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190183996] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:30:41,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:30:41,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-09-15 19:30:41,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099930315] [2024-09-15 19:30:41,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:30:41,449 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-15 19:30:41,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:30:41,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-15 19:30:41,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2024-09-15 19:30:41,450 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 27 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 16 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) [2024-09-15 19:30:45,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-15 19:30:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:30:45,925 INFO L93 Difference]: Finished difference Result 246 states and 327 transitions. [2024-09-15 19:30:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-15 19:30:45,925 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 16 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) Word has length 104 [2024-09-15 19:30:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:30:45,926 INFO L225 Difference]: With dead ends: 246 [2024-09-15 19:30:45,927 INFO L226 Difference]: Without dead ends: 185 [2024-09-15 19:30:45,927 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2024-09-15 19:30:45,927 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 34 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-09-15 19:30:45,928 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 422 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-09-15 19:30:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-09-15 19:30:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 161. [2024-09-15 19:30:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 103 states have internal predecessors, (112), 47 states have call successors, (47), 18 states have call predecessors, (47), 17 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2024-09-15 19:30:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 204 transitions. [2024-09-15 19:30:45,994 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 204 transitions. Word has length 104 [2024-09-15 19:30:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:30:45,994 INFO L474 AbstractCegarLoop]: Abstraction has 161 states and 204 transitions. [2024-09-15 19:30:45,995 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 16 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (32), 14 states have call predecessors, (32), 14 states have call successors, (32) [2024-09-15 19:30:45,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 204 transitions. [2024-09-15 19:30:45,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-15 19:30:45,996 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:30:45,996 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:30:46,009 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-15 19:30:46,196 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:30:46,196 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:30:46,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1191181482, now seen corresponding path program 2 times [2024-09-15 19:30:46,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:30:46,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720674351] [2024-09-15 19:30:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:30:46,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:30:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:30:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:30:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 19:30:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-15 19:30:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-15 19:30:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-15 19:30:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-15 19:30:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-15 19:30:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-15 19:30:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-15 19:30:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-15 19:30:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-15 19:30:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-15 19:30:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-15 19:30:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-15 19:30:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,484 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-09-15 19:30:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-09-15 19:30:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-15 19:30:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-15 19:30:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:30:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720674351] [2024-09-15 19:30:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720674351] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:30:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602670437] [2024-09-15 19:30:46,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-15 19:30:46,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:30:46,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:30:46,493 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:30:46,494 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-15 19:30:46,543 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-15 19:30:46,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:30:46,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-15 19:30:46,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:30:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-09-15 19:30:46,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:30:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-09-15 19:30:47,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602670437] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:30:47,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:30:47,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 25 [2024-09-15 19:30:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160474483] [2024-09-15 19:30:47,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:30:47,605 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-15 19:30:47,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:30:47,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-15 19:30:47,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2024-09-15 19:30:47,606 INFO L87 Difference]: Start difference. First operand 161 states and 204 transitions. Second operand has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 18 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 18 states have call predecessors, (49), 18 states have call successors, (49) [2024-09-15 19:30:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:30:47,932 INFO L93 Difference]: Finished difference Result 187 states and 231 transitions. [2024-09-15 19:30:47,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-15 19:30:47,932 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 18 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 18 states have call predecessors, (49), 18 states have call successors, (49) Word has length 109 [2024-09-15 19:30:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:30:47,934 INFO L225 Difference]: With dead ends: 187 [2024-09-15 19:30:47,934 INFO L226 Difference]: Without dead ends: 145 [2024-09-15 19:30:47,934 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2024-09-15 19:30:47,935 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 19:30:47,935 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 334 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 19:30:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-09-15 19:30:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2024-09-15 19:30:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 89 states have internal predecessors, (96), 38 states have call successors, (38), 17 states have call predecessors, (38), 16 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2024-09-15 19:30:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 170 transitions. [2024-09-15 19:30:47,988 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 170 transitions. Word has length 109 [2024-09-15 19:30:47,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:30:47,988 INFO L474 AbstractCegarLoop]: Abstraction has 139 states and 170 transitions. [2024-09-15 19:30:47,988 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.52) internal successors, (63), 24 states have internal predecessors, (63), 18 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 18 states have call predecessors, (49), 18 states have call successors, (49) [2024-09-15 19:30:47,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 170 transitions. [2024-09-15 19:30:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-09-15 19:30:47,989 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:30:47,989 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:30:48,003 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-15 19:30:48,193 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-15 19:30:48,193 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:30:48,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:48,194 INFO L85 PathProgramCache]: Analyzing trace with hash -626389098, now seen corresponding path program 1 times [2024-09-15 19:30:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:30:48,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675396137] [2024-09-15 19:30:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:30:48,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:30:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:30:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:30:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 19:30:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-15 19:30:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-15 19:30:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-15 19:30:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-15 19:30:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-15 19:30:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-15 19:30:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-15 19:30:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-15 19:30:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-15 19:30:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-15 19:30:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-15 19:30:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,339 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-15 19:30:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-15 19:30:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-15 19:30:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-15 19:30:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,346 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-15 19:30:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,348 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-15 19:30:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 51 proven. 28 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-15 19:30:48,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:30:48,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675396137] [2024-09-15 19:30:48,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675396137] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:30:48,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362598657] [2024-09-15 19:30:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:30:48,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:30:48,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:30:48,352 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:30:48,353 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-15 19:30:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:48,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-15 19:30:48,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:30:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-15 19:30:48,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:30:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-15 19:30:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362598657] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:30:48,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-15 19:30:48,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 9 [2024-09-15 19:30:48,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242550654] [2024-09-15 19:30:48,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-15 19:30:48,577 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-15 19:30:48,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:30:48,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-15 19:30:48,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-15 19:30:48,577 INFO L87 Difference]: Start difference. First operand 139 states and 170 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 9 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) [2024-09-15 19:30:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:30:48,693 INFO L93 Difference]: Finished difference Result 155 states and 191 transitions. [2024-09-15 19:30:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 19:30:48,694 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 9 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) Word has length 121 [2024-09-15 19:30:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:30:48,695 INFO L225 Difference]: With dead ends: 155 [2024-09-15 19:30:48,695 INFO L226 Difference]: Without dead ends: 148 [2024-09-15 19:30:48,695 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 276 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-15 19:30:48,696 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:30:48,696 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 185 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:30:48,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-09-15 19:30:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2024-09-15 19:30:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 93 states have internal predecessors, (100), 42 states have call successors, (42), 17 states have call predecessors, (42), 16 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-15 19:30:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 182 transitions. [2024-09-15 19:30:48,757 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 182 transitions. Word has length 121 [2024-09-15 19:30:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:30:48,758 INFO L474 AbstractCegarLoop]: Abstraction has 147 states and 182 transitions. [2024-09-15 19:30:48,758 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 9 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) [2024-09-15 19:30:48,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 182 transitions. [2024-09-15 19:30:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-09-15 19:30:48,759 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:30:48,759 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:30:48,771 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-15 19:30:48,963 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-15 19:30:48,964 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:30:48,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1967500462, now seen corresponding path program 1 times [2024-09-15 19:30:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:30:48,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171911097] [2024-09-15 19:30:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:30:48,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:30:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 19:30:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-15 19:30:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-15 19:30:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-15 19:30:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,091 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-15 19:30:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-15 19:30:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-15 19:30:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-15 19:30:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-15 19:30:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,100 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-15 19:30:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-15 19:30:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,107 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-15 19:30:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-15 19:30:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-15 19:30:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-15 19:30:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-15 19:30:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-09-15 19:30:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-15 19:30:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-15 19:30:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-15 19:30:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-09-15 19:30:49,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:30:49,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171911097] [2024-09-15 19:30:49,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171911097] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:30:49,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917853806] [2024-09-15 19:30:49,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:30:49,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:30:49,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:30:49,124 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:30:49,125 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-15 19:30:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:30:49,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-15 19:30:49,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:30:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2024-09-15 19:30:49,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:30:49,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917853806] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:30:49,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-15 19:30:49,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-09-15 19:30:49,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530424038] [2024-09-15 19:30:49,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:30:49,274 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 19:30:49,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:30:49,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 19:30:49,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-15 19:30:49,275 INFO L87 Difference]: Start difference. First operand 147 states and 182 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-15 19:30:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:30:49,400 INFO L93 Difference]: Finished difference Result 190 states and 238 transitions. [2024-09-15 19:30:49,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 19:30:49,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 123 [2024-09-15 19:30:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:30:49,402 INFO L225 Difference]: With dead ends: 190 [2024-09-15 19:30:49,402 INFO L226 Difference]: Without dead ends: 147 [2024-09-15 19:30:49,402 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-15 19:30:49,403 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:30:49,403 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 125 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:30:49,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-09-15 19:30:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2024-09-15 19:30:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.1139240506329113) internal successors, (88), 83 states have internal predecessors, (88), 34 states have call successors, (34), 17 states have call predecessors, (34), 16 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-09-15 19:30:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2024-09-15 19:30:49,460 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 123 [2024-09-15 19:30:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:30:49,461 INFO L474 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2024-09-15 19:30:49,461 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-15 19:30:49,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2024-09-15 19:30:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-09-15 19:30:49,463 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:30:49,463 INFO L216 NwaCegarLoop]: trace histogram [21, 20, 20, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:30:49,476 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-15 19:30:49,664 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-15 19:30:49,664 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:30:49,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:49,664 INFO L85 PathProgramCache]: Analyzing trace with hash -478157618, now seen corresponding path program 3 times [2024-09-15 19:30:49,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:30:49,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887681852] [2024-09-15 19:30:49,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:30:49,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:30:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:30:49,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1832127400] [2024-09-15 19:30:49,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-15 19:30:49,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:30:49,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:30:49,687 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-15 19:30:49,688 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-15 19:30:49,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-15 19:30:49,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-15 19:30:49,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-15 19:30:49,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:30:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 163 proven. 53 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2024-09-15 19:30:49,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:30:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-09-15 19:30:49,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:30:49,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887681852] [2024-09-15 19:30:49,967 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:30:49,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832127400] [2024-09-15 19:30:49,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832127400] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:30:49,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:30:49,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-09-15 19:30:49,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683262653] [2024-09-15 19:30:49,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:30:49,968 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-15 19:30:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:30:49,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-15 19:30:49,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-09-15 19:30:49,968 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 16 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2024-09-15 19:30:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:30:50,122 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2024-09-15 19:30:50,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 19:30:50,122 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) Word has length 134 [2024-09-15 19:30:50,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:30:50,123 INFO L225 Difference]: With dead ends: 130 [2024-09-15 19:30:50,123 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 19:30:50,124 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-09-15 19:30:50,124 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:30:50,124 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 161 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 19:30:50,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 19:30:50,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 19:30:50,125 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:30:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 19:30:50,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2024-09-15 19:30:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:30:50,125 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 19:30:50,125 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 7 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2024-09-15 19:30:50,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:30:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 19:30:50,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 19:30:50,128 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-15 19:30:50,140 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-15 19:30:50,332 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-15 19:30:50,335 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:30:50,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-15 19:30:52,394 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 19:30:52,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 07:30:52 BoogieIcfgContainer [2024-09-15 19:30:52,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 19:30:52,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-15 19:30:52,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-15 19:30:52,408 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-15 19:30:52,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:29:41" (3/4) ... [2024-09-15 19:30:52,410 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-15 19:30:52,412 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-15 19:30:52,412 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-15 19:30:52,412 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-15 19:30:52,413 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-15 19:30:52,415 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-09-15 19:30:52,415 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-09-15 19:30:52,415 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-15 19:30:52,415 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 19:30:52,415 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 19:30:52,479 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-15 19:30:52,479 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-15 19:30:52,479 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-15 19:30:52,479 INFO L158 Benchmark]: Toolchain (without parser) took 71073.62ms. Allocated memory was 94.4MB in the beginning and 237.0MB in the end (delta: 142.6MB). Free memory was 71.3MB in the beginning and 86.2MB in the end (delta: -14.8MB). Peak memory consumption was 128.0MB. Max. memory is 16.1GB. [2024-09-15 19:30:52,483 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 19:30:52,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.16ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 59.3MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-15 19:30:52,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.39ms. Allocated memory is still 94.4MB. Free memory was 59.3MB in the beginning and 58.5MB in the end (delta: 865.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 19:30:52,484 INFO L158 Benchmark]: Boogie Preprocessor took 37.20ms. Allocated memory is still 94.4MB. Free memory was 58.5MB in the beginning and 56.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 19:30:52,484 INFO L158 Benchmark]: RCFGBuilder took 320.19ms. Allocated memory is still 94.4MB. Free memory was 56.7MB in the beginning and 68.3MB in the end (delta: -11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-15 19:30:52,484 INFO L158 Benchmark]: TraceAbstraction took 70414.32ms. Allocated memory was 94.4MB in the beginning and 237.0MB in the end (delta: 142.6MB). Free memory was 67.9MB in the beginning and 91.4MB in the end (delta: -23.5MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. [2024-09-15 19:30:52,484 INFO L158 Benchmark]: Witness Printer took 70.98ms. Allocated memory is still 237.0MB. Free memory was 91.4MB in the beginning and 86.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-15 19:30:52,485 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.16ms. Allocated memory is still 94.4MB. Free memory was 71.0MB in the beginning and 59.3MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.39ms. Allocated memory is still 94.4MB. Free memory was 59.3MB in the beginning and 58.5MB in the end (delta: 865.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.20ms. Allocated memory is still 94.4MB. Free memory was 58.5MB in the beginning and 56.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.19ms. Allocated memory is still 94.4MB. Free memory was 56.7MB in the beginning and 68.3MB in the end (delta: -11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 70414.32ms. Allocated memory was 94.4MB in the beginning and 237.0MB in the end (delta: 142.6MB). Free memory was 67.9MB in the beginning and 91.4MB in the end (delta: -23.5MB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. * Witness Printer took 70.98ms. Allocated memory is still 237.0MB. Free memory was 91.4MB in the beginning and 86.2MB 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: 17]: 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.3s, OverallIterations: 16, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 40.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 319 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 3086 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2515 mSDsCounter, 424 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2567 IncrementalHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 424 mSolverCounterUnsat, 571 mSDtfsCounter, 2567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2069 GetRequests, 1867 SyntacticMatches, 10 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 33.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=11, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 96 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 2106 NumberOfCodeBlocks, 2036 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2327 ConstructedInterpolants, 0 QuantifiedInterpolants, 21218 SizeOfPredicates, 25 NumberOfNonLiveVariables, 2338 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 9533/10134 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: 44]: Loop Invariant Derived loop invariant: ((((d == p) && (1 <= p)) && (((long long) A + d) == (((long long) q + p) + r))) && (B == 1)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((A == r) && (p == 2)) && (d == 2)) && (q == 0)) && (B == 1)) || (((((((A == r) && (((long long) A + d) == ((long long) p + r))) && ((d / 2) <= r)) && ((d % 2) == 0)) && (q == 0)) && (B == 1)) && (4 <= (d / 2)))) || ((((((A == r) && (d == 4)) && (2 <= r)) && (q == 0)) && (B == 1)) && (p == 4))) || (((((A == r) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-15 19:30:52,546 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