./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound10.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/prodbin-ll_valuebound10.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ca6b6f09277139d829682a6458fdcdacf72411331aa404fd46248e3dcb9a9e7f --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:00:11,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:00:11,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:00:11,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:00:11,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:00:11,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:00:11,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:00:11,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:00:11,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:00:11,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:00:11,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:00:11,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:00:11,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:00:11,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:00:11,930 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:00:11,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:00:11,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:00:11,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:00:11,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:00:11,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:00:11,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:00:11,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:00:11,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:00:11,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:00:11,938 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:00:11,938 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:00:11,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:00:11,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:00:11,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:00:11,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:00:11,940 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:00:11,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:00:11,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:00:11,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:00:11,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:00:11,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:00:11,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:00:11,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:00:11,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:00:11,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:00:11,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:00:11,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:00:11,943 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 -> ca6b6f09277139d829682a6458fdcdacf72411331aa404fd46248e3dcb9a9e7f Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:00:12,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:00:12,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:00:12,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:00:12,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:00:12,297 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:00:12,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound10.c [2024-09-25 00:00:13,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:00:14,013 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:00:14,013 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound10.c [2024-09-25 00:00:14,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e1f0233cc/df9713cd06bb475a950a707a64aea20d/FLAG8a854f4e9 [2024-09-25 00:00:14,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e1f0233cc/df9713cd06bb475a950a707a64aea20d [2024-09-25 00:00:14,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:00:14,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:00:14,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:00:14,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:00:14,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:00:14,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14, skipping insertion in model container [2024-09-25 00:00:14,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:00:14,611 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/prodbin-ll_valuebound10.c[537,550] [2024-09-25 00:00:14,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:00:14,635 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:00:14,652 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/prodbin-ll_valuebound10.c[537,550] [2024-09-25 00:00:14,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:00:14,672 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:00:14,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14 WrapperNode [2024-09-25 00:00:14,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:00:14,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:00:14,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:00:14,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:00:14,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,696 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:00:14,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:00:14,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:00:14,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:00:14,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:00:14,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,721 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 00:00:14,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:00:14,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:00:14,742 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:00:14,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:00:14,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (1/1) ... [2024-09-25 00:00:14,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:00:14,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:00:14,779 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-25 00:00:14,782 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-25 00:00:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:00:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 00:00:14,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 00:00:14,829 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:00:14,829 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:00:14,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:00:14,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:00:14,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:00:14,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:00:14,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:00:14,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:00:14,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:00:14,900 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:00:14,903 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:00:15,082 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 00:00:15,083 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:00:15,108 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:00:15,108 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 00:00:15,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:00:15 BoogieIcfgContainer [2024-09-25 00:00:15,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:00:15,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:00:15,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:00:15,117 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:00:15,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:00:14" (1/3) ... [2024-09-25 00:00:15,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24cfef32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:00:15, skipping insertion in model container [2024-09-25 00:00:15,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:00:14" (2/3) ... [2024-09-25 00:00:15,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24cfef32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:00:15, skipping insertion in model container [2024-09-25 00:00:15,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:00:15" (3/3) ... [2024-09-25 00:00:15,121 INFO L112 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound10.c [2024-09-25 00:00:15,145 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:00:15,145 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:00:15,222 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:00:15,230 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;@3de7e356, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:00:15,231 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:00:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 00:00:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 00:00:15,245 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:00:15,246 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:00:15,247 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:00:15,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2062108722, now seen corresponding path program 1 times [2024-09-25 00:00:15,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:00:15,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359404330] [2024-09-25 00:00:15,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:15,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:00:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:15,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:00:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:15,447 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:00:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:15,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:00:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:15,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:00:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:00:15,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:00:15,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359404330] [2024-09-25 00:00:15,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359404330] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:00:15,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:00:15,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 00:00:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096873223] [2024-09-25 00:00:15,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:00:15,480 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 00:00:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:00:15,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 00:00:15,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 00:00:15,502 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:00:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:00:15,532 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2024-09-25 00:00:15,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 00:00:15,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-25 00:00:15,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:00:15,540 INFO L225 Difference]: With dead ends: 54 [2024-09-25 00:00:15,540 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 00:00:15,543 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-25 00:00:15,547 INFO L434 NwaCegarLoop]: 32 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, 32 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-25 00:00:15,548 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:00:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 00:00:15,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-25 00:00:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 00:00:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-25 00:00:15,583 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 27 [2024-09-25 00:00:15,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:00:15,583 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-25 00:00:15,584 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:00:15,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-25 00:00:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 00:00:15,589 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:00:15,590 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:00:15,590 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:00:15,590 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:00:15,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1085938704, now seen corresponding path program 1 times [2024-09-25 00:00:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:00:15,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93000968] [2024-09-25 00:00:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:15,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:00:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:00:15,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367876217] [2024-09-25 00:00:15,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:15,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:15,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:00:15,665 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-25 00:00:15,670 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-25 00:00:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:15,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 00:00:15,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:00:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:00:16,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:00:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:00:16,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:00:16,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93000968] [2024-09-25 00:00:16,143 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:00:16,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367876217] [2024-09-25 00:00:16,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367876217] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 00:00:16,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:00:16,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2024-09-25 00:00:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497136238] [2024-09-25 00:00:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:00:16,150 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:00:16,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:00:16,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:00:16,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-25 00:00:16,151 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 00:00:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:00:16,268 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-09-25 00:00:16,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:00:16,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-25 00:00:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:00:16,270 INFO L225 Difference]: With dead ends: 37 [2024-09-25 00:00:16,270 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 00:00:16,271 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:00:16,273 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:00:16,273 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 80 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:00:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 00:00:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-09-25 00:00:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:00:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-25 00:00:16,286 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27 [2024-09-25 00:00:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:00:16,287 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-25 00:00:16,288 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 00:00:16,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-25 00:00:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-25 00:00:16,290 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:00:16,290 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:00:16,310 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:00:16,494 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:16,495 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:00:16,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1368497365, now seen corresponding path program 1 times [2024-09-25 00:00:16,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:00:16,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612953361] [2024-09-25 00:00:16,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:00:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:16,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:00:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:16,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:00:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:16,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:00:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:16,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:00:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:16,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:00:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:00:16,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:00:16,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612953361] [2024-09-25 00:00:16,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612953361] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:00:16,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:00:16,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:00:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104278124] [2024-09-25 00:00:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:00:16,800 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:00:16,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:00:16,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:00:16,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:00:16,801 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 00:00:16,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:00:16,912 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-09-25 00:00:16,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:00:16,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2024-09-25 00:00:16,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:00:16,914 INFO L225 Difference]: With dead ends: 42 [2024-09-25 00:00:16,914 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 00:00:16,915 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:00:16,916 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:00:16,918 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 87 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:00:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 00:00:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-09-25 00:00:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:00:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-25 00:00:16,934 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 33 [2024-09-25 00:00:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:00:16,935 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-25 00:00:16,937 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 00:00:16,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-25 00:00:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 00:00:16,939 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:00:16,940 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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-25 00:00:16,940 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 00:00:16,940 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:00:16,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash -65395240, now seen corresponding path program 1 times [2024-09-25 00:00:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:00:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425434435] [2024-09-25 00:00:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:00:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:00:17,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [391200976] [2024-09-25 00:00:17,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:17,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:17,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:00:17,007 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-25 00:00:17,011 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-25 00:00:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:17,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 00:00:17,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:00:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:00:17,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:00:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:00:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:00:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425434435] [2024-09-25 00:00:18,562 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:00:18,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391200976] [2024-09-25 00:00:18,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391200976] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 00:00:18,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:00:18,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2024-09-25 00:00:18,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255917270] [2024-09-25 00:00:18,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:00:18,567 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 00:00:18,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:00:18,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 00:00:18,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:00:18,568 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 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-25 00:00:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:00:18,804 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-09-25 00:00:18,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:00:18,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 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 36 [2024-09-25 00:00:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:00:18,806 INFO L225 Difference]: With dead ends: 45 [2024-09-25 00:00:18,806 INFO L226 Difference]: Without dead ends: 43 [2024-09-25 00:00:18,806 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:00:18,807 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:00:18,808 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 117 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:00:18,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-25 00:00:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-09-25 00:00:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 28 states have internal predecessors, (32), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 00:00:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-09-25 00:00:18,823 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 36 [2024-09-25 00:00:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:00:18,824 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-09-25 00:00:18,824 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 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-25 00:00:18,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:18,826 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-09-25 00:00:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 00:00:18,828 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:00:18,828 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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-25 00:00:18,847 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:00:19,032 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:19,033 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:00:19,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1709612122, now seen corresponding path program 1 times [2024-09-25 00:00:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:00:19,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213012728] [2024-09-25 00:00:19,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:00:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:00:19,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397377086] [2024-09-25 00:00:19,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:19,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:19,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:00:19,057 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-25 00:00:19,060 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-25 00:00:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:19,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 00:00:19,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:00:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:00:19,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:00:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:00:20,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:00:20,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213012728] [2024-09-25 00:00:20,249 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:00:20,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397377086] [2024-09-25 00:00:20,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397377086] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:00:20,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:00:20,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2024-09-25 00:00:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113506343] [2024-09-25 00:00:20,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:00:20,250 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 00:00:20,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:00:20,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 00:00:20,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-09-25 00:00:20,255 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-25 00:00:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:00:20,970 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2024-09-25 00:00:20,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-25 00:00:20,971 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 36 [2024-09-25 00:00:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:00:20,974 INFO L225 Difference]: With dead ends: 67 [2024-09-25 00:00:20,974 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 00:00:20,975 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2024-09-25 00:00:20,976 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:00:20,976 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 161 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:00:20,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 00:00:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-09-25 00:00:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 00:00:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2024-09-25 00:00:21,001 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 36 [2024-09-25 00:00:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:00:21,002 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2024-09-25 00:00:21,003 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 6 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-25 00:00:21,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2024-09-25 00:00:21,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-25 00:00:21,005 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:00:21,005 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-25 00:00:21,027 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 00:00:21,210 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:21,211 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:00:21,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:21,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1894068381, now seen corresponding path program 1 times [2024-09-25 00:00:21,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:00:21,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556399932] [2024-09-25 00:00:21,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:21,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:00:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:00:21,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896324577] [2024-09-25 00:00:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:21,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:21,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:00:21,239 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-25 00:00:21,241 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-25 00:00:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:21,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 00:00:21,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:00:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:00:21,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:00:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:00:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:00:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556399932] [2024-09-25 00:00:21,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:00:21,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896324577] [2024-09-25 00:00:21,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896324577] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:00:21,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:00:21,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2024-09-25 00:00:21,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083525945] [2024-09-25 00:00:21,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:00:21,464 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 00:00:21,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:00:21,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 00:00:21,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-25 00:00:21,465 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-25 00:00:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:00:21,573 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2024-09-25 00:00:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 00:00:21,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) Word has length 42 [2024-09-25 00:00:21,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:00:21,575 INFO L225 Difference]: With dead ends: 67 [2024-09-25 00:00:21,576 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 00:00:21,576 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:00:21,577 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:00:21,577 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:00:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 00:00:21,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-25 00:00:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 00:00:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-09-25 00:00:21,606 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 42 [2024-09-25 00:00:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:00:21,607 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-09-25 00:00:21,607 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-25 00:00:21,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-09-25 00:00:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-25 00:00:21,610 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:00:21,611 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:00:21,630 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 00:00:21,811 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:21,812 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:00:21,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash -455011438, now seen corresponding path program 1 times [2024-09-25 00:00:21,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:00:21,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868989285] [2024-09-25 00:00:21,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:00:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:00:21,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1293787151] [2024-09-25 00:00:21,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:21,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:21,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:00:21,848 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-25 00:00:21,851 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-25 00:00:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:21,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 00:00:21,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:00:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-25 00:00:22,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:00:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-25 00:00:27,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:00:27,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868989285] [2024-09-25 00:00:27,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:00:27,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293787151] [2024-09-25 00:00:27,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293787151] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:00:27,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:00:27,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2024-09-25 00:00:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200120296] [2024-09-25 00:00:27,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:00:27,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 00:00:27,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:00:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 00:00:27,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-09-25 00:00:27,549 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 00:00:29,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-25 00:00:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:00:36,985 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2024-09-25 00:00:36,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 00:00:36,986 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 45 [2024-09-25 00:00:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:00:36,987 INFO L225 Difference]: With dead ends: 90 [2024-09-25 00:00:36,987 INFO L226 Difference]: Without dead ends: 88 [2024-09-25 00:00:36,988 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-09-25 00:00:36,988 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-09-25 00:00:36,989 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 151 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-09-25 00:00:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-25 00:00:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2024-09-25 00:00:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.14) internal successors, (57), 52 states have internal predecessors, (57), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 00:00:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2024-09-25 00:00:37,013 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 45 [2024-09-25 00:00:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:00:37,013 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2024-09-25 00:00:37,014 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 00:00:37,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:37,014 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2024-09-25 00:00:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-25 00:00:37,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:00:37,015 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:00:37,037 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 00:00:37,216 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 00:00:37,216 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:00:37,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:37,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1692331952, now seen corresponding path program 2 times [2024-09-25 00:00:37,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:00:37,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516666667] [2024-09-25 00:00:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:37,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:00:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:37,918 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:00:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:37,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:00:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:37,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:00:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:37,950 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:00:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:37,955 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:00:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:37,961 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 00:00:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:37,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 00:00:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:37,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 00:00:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 00:00:37,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:00:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516666667] [2024-09-25 00:00:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516666667] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:00:37,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912099529] [2024-09-25 00:00:37,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:00:37,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:37,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:00:38,001 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-25 00:00:38,002 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-25 00:00:38,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:00:38,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:00:38,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-25 00:00:38,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:00:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 00:00:38,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:00:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 36 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 00:00:38,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912099529] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:00:38,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:00:38,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 24 [2024-09-25 00:00:38,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137050506] [2024-09-25 00:00:38,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:00:38,755 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 00:00:38,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:00:38,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 00:00:38,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-09-25 00:00:38,756 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 24 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 13 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-09-25 00:00:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:00:39,406 INFO L93 Difference]: Finished difference Result 141 states and 167 transitions. [2024-09-25 00:00:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-25 00:00:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 13 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) Word has length 63 [2024-09-25 00:00:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:00:39,408 INFO L225 Difference]: With dead ends: 141 [2024-09-25 00:00:39,408 INFO L226 Difference]: Without dead ends: 67 [2024-09-25 00:00:39,409 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 126 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=444, Invalid=1278, Unknown=0, NotChecked=0, Total=1722 [2024-09-25 00:00:39,410 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:00:39,410 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 298 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:00:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-09-25 00:00:39,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-09-25 00:00:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-25 00:00:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2024-09-25 00:00:39,440 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 63 [2024-09-25 00:00:39,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:00:39,441 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2024-09-25 00:00:39,441 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 13 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-09-25 00:00:39,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:39,442 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2024-09-25 00:00:39,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-25 00:00:39,443 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:00:39,443 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:00:39,461 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 00:00:39,647 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:39,648 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:00:39,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash 358652046, now seen corresponding path program 3 times [2024-09-25 00:00:39,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:00:39,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557485286] [2024-09-25 00:00:39,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:39,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:00:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:40,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:00:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:40,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:00:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:40,277 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:00:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:40,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:00:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:40,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:00:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:40,314 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 00:00:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:40,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 00:00:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:40,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 00:00:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 00:00:40,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:00:40,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557485286] [2024-09-25 00:00:40,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557485286] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:00:40,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635855565] [2024-09-25 00:00:40,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:00:40,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:40,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:00:40,333 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-25 00:00:40,335 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-25 00:00:40,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 00:00:40,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:00:40,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 00:00:40,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:00:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 36 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-09-25 00:00:41,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:00:43,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635855565] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:00:43,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:00:43,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2024-09-25 00:00:43,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132530685] [2024-09-25 00:00:43,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:00:43,425 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 00:00:43,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:00:43,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 00:00:43,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=858, Unknown=0, NotChecked=0, Total=992 [2024-09-25 00:00:43,427 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-09-25 00:00:44,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:00:44,296 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2024-09-25 00:00:44,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-25 00:00:44,297 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) Word has length 63 [2024-09-25 00:00:44,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:00:44,298 INFO L225 Difference]: With dead ends: 77 [2024-09-25 00:00:44,298 INFO L226 Difference]: Without dead ends: 50 [2024-09-25 00:00:44,299 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=282, Invalid=1788, Unknown=0, NotChecked=0, Total=2070 [2024-09-25 00:00:44,299 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 00:00:44,299 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 330 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 00:00:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-25 00:00:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-09-25 00:00:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 00:00:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-09-25 00:00:44,313 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 63 [2024-09-25 00:00:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:00:44,313 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-09-25 00:00:44,313 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 23 states have internal predecessors, (55), 11 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2024-09-25 00:00:44,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-09-25 00:00:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-25 00:00:44,315 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:00:44,315 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:00:44,332 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 00:00:44,521 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:44,522 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:00:44,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash 499200656, now seen corresponding path program 2 times [2024-09-25 00:00:44,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:00:44,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435440066] [2024-09-25 00:00:44,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:00:44,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:00:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:44,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:00:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:44,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:00:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:45,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:00:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:45,025 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:00:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:45,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:00:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:45,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 00:00:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:45,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 00:00:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:45,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 00:00:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:00:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 32 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 00:00:45,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:00:45,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435440066] [2024-09-25 00:00:45,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435440066] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:00:45,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518813665] [2024-09-25 00:00:45,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:00:45,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:45,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:00:45,061 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-25 00:00:45,062 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-25 00:00:45,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:00:45,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:00:45,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 00:00:45,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:00:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 00:00:45,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:00:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-25 00:00:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518813665] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:00:45,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:00:45,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2024-09-25 00:00:45,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759603834] [2024-09-25 00:00:45,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:00:45,986 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-25 00:00:45,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:00:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-25 00:00:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2024-09-25 00:00:45,988 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 26 states have internal predecessors, (66), 17 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 17 states have call predecessors, (20), 16 states have call successors, (20) [2024-09-25 00:00:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:00:46,184 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2024-09-25 00:00:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 00:00:46,188 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 26 states have internal predecessors, (66), 17 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 17 states have call predecessors, (20), 16 states have call successors, (20) Word has length 63 [2024-09-25 00:00:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:00:46,189 INFO L225 Difference]: With dead ends: 52 [2024-09-25 00:00:46,189 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:00:46,190 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2024-09-25 00:00:46,190 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 15 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:00:46,191 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 246 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:00:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:00:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:00:46,192 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-25 00:00:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:00:46,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2024-09-25 00:00:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:00:46,192 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:00:46,193 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.2758620689655173) internal successors, (66), 26 states have internal predecessors, (66), 17 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 17 states have call predecessors, (20), 16 states have call successors, (20) [2024-09-25 00:00:46,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:00:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:00:46,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:00:46,196 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:00:46,204 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-25 00:00:46,397 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:00:46,400 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2024-09-25 00:00:46,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:00:50,964 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:00:50,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:00:50 BoogieIcfgContainer [2024-09-25 00:00:50,998 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:00:50,998 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:00:50,998 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:00:50,998 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:00:50,999 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:00:15" (3/4) ... [2024-09-25 00:00:51,001 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:00:51,063 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:00:51,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:00:51,064 INFO L158 Benchmark]: Toolchain (without parser) took 36650.04ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 108.1MB in the beginning and 87.8MB in the end (delta: 20.3MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2024-09-25 00:00:51,065 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 96.5MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:00:51,065 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.09ms. Allocated memory is still 153.1MB. Free memory was 108.1MB in the beginning and 96.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:00:51,065 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.10ms. Allocated memory is still 153.1MB. Free memory was 96.6MB in the beginning and 95.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:00:51,065 INFO L158 Benchmark]: Boogie Preprocessor took 43.88ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 93.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:00:51,066 INFO L158 Benchmark]: RCFGBuilder took 367.48ms. Allocated memory is still 153.1MB. Free memory was 93.9MB in the beginning and 116.5MB in the end (delta: -22.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 00:00:51,066 INFO L158 Benchmark]: TraceAbstraction took 35886.02ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 116.5MB in the beginning and 89.9MB in the end (delta: 26.6MB). Peak memory consumption was 104.3MB. Max. memory is 16.1GB. [2024-09-25 00:00:51,067 INFO L158 Benchmark]: Witness Printer took 65.65ms. Allocated memory is still 184.5MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:00:51,068 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.31ms. Allocated memory is still 96.5MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.09ms. Allocated memory is still 153.1MB. Free memory was 108.1MB in the beginning and 96.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.10ms. Allocated memory is still 153.1MB. Free memory was 96.6MB in the beginning and 95.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.88ms. Allocated memory is still 153.1MB. Free memory was 95.5MB in the beginning and 93.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 367.48ms. Allocated memory is still 153.1MB. Free memory was 93.9MB in the beginning and 116.5MB in the end (delta: -22.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 35886.02ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 116.5MB in the beginning and 89.9MB in the end (delta: 26.6MB). Peak memory consumption was 104.3MB. Max. memory is 16.1GB. * Witness Printer took 65.65ms. Allocated memory is still 184.5MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 15]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.2s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 1625 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1387 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1480 IncrementalHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 238 mSDtfsCounter, 1480 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 870 GetRequests, 648 SyntacticMatches, 23 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 810 NumberOfCodeBlocks, 801 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 916 ConstructedInterpolants, 8 QuantifiedInterpolants, 5036 SizeOfPredicates, 12 NumberOfNonLiveVariables, 897 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 722/874 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: 34]: Loop Invariant Derived loop invariant: ((((((((((((((z == 0) && (y == (b / 2))) && (((long long) a * 2) == x)) && (0 <= a)) && ((b % 2) != 1)) && (1 <= y)) && (a <= 10)) && (y <= 5)) || ((((((((1 <= (b % 2)) && ((z + ((__int128) y * x)) == ((long long) b * a))) && (((long long) a * 2) == x)) && (0 <= a)) && (1 <= b)) && (b <= 10)) && (a <= 10)) && ((((long long) -1 + b) / 2) == y))) || ((((((((z == 0) && (((__int128) y * x) == ((long long) b * a))) && (y <= 2)) && (0 <= a)) && (1 <= b)) && (1 <= y)) && (b <= 10)) && (a <= 10))) || (((((((z == 0) && (b == y)) && (0 <= a)) && (1 <= y)) && (b <= 10)) && (a == x)) && (a <= 10))) || (((((((0 <= y) && ((z + ((__int128) y * x)) == ((long long) b * a))) && (0 <= a)) && (1 <= b)) && (b <= 10)) && (a <= 10)) && (y <= 1))) || ((((((((0 <= y) && ((z + ((__int128) y * x)) == ((long long) b * a))) && (y <= 2)) && (0 <= a)) && (x == ((__int128) z * 2))) && (1 <= b)) && (b <= 10)) && (a <= 10))) || (((((((((a == z) && (1 <= (b % 2))) && (((long long) a * 4) == x)) && (0 <= a)) && (0 <= b)) && (((((long long) -1 + b) / 2) % 2) != 1)) && ((((long long) -1 + b) / 4) == y)) && (b <= 10)) && (a <= 10))) - ProcedureContractResult [Line: 9]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 12]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:00:51,123 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE