./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f73abe50a425917d2dd4066f1792742190b4ae9dbdaa6d6431079d0ef1d76a5 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 19:16:19,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:16:19,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:16:19,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:16:19,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:16:19,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:16:19,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:16:19,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:16:19,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:16:19,814 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:16:19,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:16:19,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:16:19,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:16:19,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:16:19,816 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:16:19,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:16:19,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:16:19,817 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:16:19,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:16:19,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:16:19,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:16:19,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:16:19,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:16:19,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:16:19,823 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:16:19,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:16:19,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:16:19,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:16:19,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:16:19,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:16:19,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:16:19,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:16:19,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:16:19,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:16:19,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:16:19,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:16:19,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:16:19,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:16:19,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:16:19,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:16:19,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:16:19,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:16:19,829 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 -> 7f73abe50a425917d2dd4066f1792742190b4ae9dbdaa6d6431079d0ef1d76a5 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.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 19:16:20,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:16:20,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:16:20,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:16:20,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:16:20,168 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:16:20,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c [2024-09-12 19:16:21,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:16:21,817 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:16:21,818 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c [2024-09-12 19:16:21,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c5acd6100/9de59f1f3917409e98823d643c8c450b/FLAG945047fa0 [2024-09-12 19:16:21,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c5acd6100/9de59f1f3917409e98823d643c8c450b [2024-09-12 19:16:21,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:16:21,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:16:21,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:16:21,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:16:21,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:16:21,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:16:21" (1/1) ... [2024-09-12 19:16:21,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d70043d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:21, skipping insertion in model container [2024-09-12 19:16:21,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:16:21" (1/1) ... [2024-09-12 19:16:21,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:16:22,056 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c[537,550] [2024-09-12 19:16:22,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:16:22,088 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:16:22,099 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound100.c[537,550] [2024-09-12 19:16:22,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:16:22,128 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:16:22,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22 WrapperNode [2024-09-12 19:16:22,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:16:22,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:16:22,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:16:22,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:16:22,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,148 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:16:22,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:16:22,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:16:22,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:16:22,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:16:22,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,183 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-12 19:16:22,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:16:22,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:16:22,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:16:22,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:16:22,202 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (1/1) ... [2024-09-12 19:16:22,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:16:22,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:16:22,234 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-12 19:16:22,237 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-12 19:16:22,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:16:22,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 19:16:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 19:16:22,277 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:16:22,277 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:16:22,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:16:22,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:16:22,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:16:22,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:16:22,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:16:22,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 19:16:22,280 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 19:16:22,341 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:16:22,343 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:16:22,523 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-12 19:16:22,524 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:16:22,551 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:16:22,552 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 19:16:22,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:16:22 BoogieIcfgContainer [2024-09-12 19:16:22,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:16:22,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:16:22,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:16:22,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:16:22,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:16:21" (1/3) ... [2024-09-12 19:16:22,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdca6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:16:22, skipping insertion in model container [2024-09-12 19:16:22,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:16:22" (2/3) ... [2024-09-12 19:16:22,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdca6f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:16:22, skipping insertion in model container [2024-09-12 19:16:22,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:16:22" (3/3) ... [2024-09-12 19:16:22,560 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound100.c [2024-09-12 19:16:22,575 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:16:22,576 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 19:16:22,638 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:16:22,646 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;@700bb41c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:16:22,647 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 19:16:22,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-12 19:16:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 19:16:22,658 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:16:22,659 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-12 19:16:22,659 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:16:22,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-12 19:16:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:16:22,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083672776] [2024-09-12 19:16:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:16:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:22,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:16:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:22,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:16:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:22,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:16:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:22,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 19:16:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:22,870 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-12 19:16:22,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:16:22,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083672776] [2024-09-12 19:16:22,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083672776] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:16:22,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:16:22,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:16:22,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357800415] [2024-09-12 19:16:22,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:16:22,884 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 19:16:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:16:22,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 19:16:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 19:16:22,913 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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-12 19:16:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:16:22,955 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-12 19:16:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 19:16:22,957 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-12 19:16:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:16:22,972 INFO L225 Difference]: With dead ends: 66 [2024-09-12 19:16:22,975 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 19:16:22,980 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-12 19:16:22,985 INFO L434 NwaCegarLoop]: 44 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, 44 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-12 19:16:22,986 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:16:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 19:16:23,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 19:16:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 19:16:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-12 19:16:23,031 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-12 19:16:23,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:16:23,032 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-12 19:16:23,032 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-12 19:16:23,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-12 19:16:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 19:16:23,035 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:16:23,035 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-12 19:16:23,036 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:16:23,036 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:16:23,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:23,037 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-12 19:16:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:16:23,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084323779] [2024-09-12 19:16:23,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:23,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:16:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,356 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:16:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,364 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:16:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:16:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 19:16:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,392 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-12 19:16:23,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:16:23,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084323779] [2024-09-12 19:16:23,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084323779] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:16:23,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:16:23,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:16:23,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032845496] [2024-09-12 19:16:23,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:16:23,394 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:16:23,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:16:23,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:16:23,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:16:23,396 INFO L87 Difference]: Start difference. First operand 32 states and 42 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-12 19:16:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:16:23,485 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-12 19:16:23,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:16:23,488 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-12 19:16:23,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:16:23,489 INFO L225 Difference]: With dead ends: 45 [2024-09-12 19:16:23,489 INFO L226 Difference]: Without dead ends: 43 [2024-09-12 19:16:23,490 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:16:23,491 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:16:23,493 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:16:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-12 19:16:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-12 19:16:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 19:16:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-12 19:16:23,511 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-12 19:16:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:16:23,512 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-12 19:16:23,512 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-12 19:16:23,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-12 19:16:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 19:16:23,515 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:16:23,515 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] [2024-09-12 19:16:23,515 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:16:23,516 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:16:23,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-12 19:16:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:16:23,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107543769] [2024-09-12 19:16:23,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:23,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:16:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:16:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:16:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:16:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 19:16:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 19:16:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 19:16:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:16:23,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107543769] [2024-09-12 19:16:23,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107543769] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:16:23,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:16:23,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:16:23,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551364882] [2024-09-12 19:16:23,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:16:23,888 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:16:23,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:16:23,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:16:23,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:16:23,890 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 19:16:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:16:24,025 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-12 19:16:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:16:24,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-12 19:16:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:16:24,027 INFO L225 Difference]: With dead ends: 49 [2024-09-12 19:16:24,027 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 19:16:24,028 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:16:24,029 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:16:24,029 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:16:24,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 19:16:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-12 19:16:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 19:16:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-12 19:16:24,038 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-12 19:16:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:16:24,039 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-12 19:16:24,039 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 19:16:24,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-12 19:16:24,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 19:16:24,041 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:16:24,041 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-12 19:16:24,041 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 19:16:24,041 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:16:24,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:24,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-12 19:16:24,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:16:24,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822221783] [2024-09-12 19:16:24,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:24,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:16:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:16:24,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309613809] [2024-09-12 19:16:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:24,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:16:24,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:16:24,072 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-12 19:16:24,074 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-12 19:16:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:24,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 19:16:24,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:16:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-12 19:16:24,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:16:24,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:16:24,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822221783] [2024-09-12 19:16:24,357 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:16:24,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309613809] [2024-09-12 19:16:24,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309613809] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:16:24,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:16:24,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 19:16:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066289459] [2024-09-12 19:16:24,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:16:24,358 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 19:16:24,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:16:24,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 19:16:24,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:16:24,363 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 19:16:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:16:24,606 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-12 19:16:24,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 19:16:24,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2024-09-12 19:16:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:16:24,608 INFO L225 Difference]: With dead ends: 66 [2024-09-12 19:16:24,610 INFO L226 Difference]: Without dead ends: 53 [2024-09-12 19:16:24,610 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:16:24,611 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 25 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:16:24,612 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 183 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:16:24,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-12 19:16:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-12 19:16:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-12 19:16:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-12 19:16:24,626 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-12 19:16:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:16:24,627 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-12 19:16:24,627 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 19:16:24,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-12 19:16:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 19:16:24,629 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:16:24,629 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:16:24,648 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 19:16:24,830 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:16:24,830 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:16:24,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-12 19:16:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:16:24,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827510223] [2024-09-12 19:16:24,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:24,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:16:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:16:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1768970664] [2024-09-12 19:16:24,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:24,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:16:24,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:16:24,872 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-12 19:16:24,873 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-12 19:16:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:24,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-12 19:16:24,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:16:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 19:16:25,242 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:16:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-12 19:16:26,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:16:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827510223] [2024-09-12 19:16:26,124 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:16:26,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768970664] [2024-09-12 19:16:26,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768970664] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:16:26,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:16:26,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-09-12 19:16:26,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069898792] [2024-09-12 19:16:26,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:16:26,125 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-12 19:16:26,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:16:26,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-12 19:16:26,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-12 19:16:26,127 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-12 19:16:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:16:26,654 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-09-12 19:16:26,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 19:16:26,655 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) Word has length 44 [2024-09-12 19:16:26,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:16:26,657 INFO L225 Difference]: With dead ends: 71 [2024-09-12 19:16:26,657 INFO L226 Difference]: Without dead ends: 63 [2024-09-12 19:16:26,658 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:16:26,659 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 19:16:26,659 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 19:16:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-12 19:16:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-12 19:16:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 39 states have internal predecessors, (41), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-12 19:16:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-09-12 19:16:26,675 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 44 [2024-09-12 19:16:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:16:26,676 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-09-12 19:16:26,676 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 7 states have call predecessors, (12), 5 states have call successors, (12) [2024-09-12 19:16:26,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-09-12 19:16:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-12 19:16:26,678 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:16:26,678 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:16:26,694 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 19:16:26,882 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:16:26,883 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:16:26,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-12 19:16:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:16:26,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111421092] [2024-09-12 19:16:26,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:26,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:16:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:16:26,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524119279] [2024-09-12 19:16:26,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:26,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:16:26,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:16:26,934 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-12 19:16:26,935 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-12 19:16:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:27,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 19:16:27,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:16:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-12 19:16:27,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:16:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-12 19:16:27,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:16:27,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111421092] [2024-09-12 19:16:27,224 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:16:27,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524119279] [2024-09-12 19:16:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524119279] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 19:16:27,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:16:27,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-09-12 19:16:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919866375] [2024-09-12 19:16:27,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:16:27,225 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:16:27,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:16:27,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:16:27,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:16:27,226 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-12 19:16:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:16:27,934 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2024-09-12 19:16:27,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:16:27,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 54 [2024-09-12 19:16:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:16:27,936 INFO L225 Difference]: With dead ends: 73 [2024-09-12 19:16:27,936 INFO L226 Difference]: Without dead ends: 71 [2024-09-12 19:16:27,937 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:16:27,937 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 19:16:27,938 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 125 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 19:16:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-12 19:16:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-12 19:16:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 44 states have internal predecessors, (45), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-12 19:16:27,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-09-12 19:16:27,970 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 54 [2024-09-12 19:16:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:16:27,970 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-09-12 19:16:27,970 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-12 19:16:27,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2024-09-12 19:16:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-09-12 19:16:27,975 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:16:27,975 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:16:27,982 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 19:16:28,176 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 19:16:28,176 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:16:28,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:28,177 INFO L85 PathProgramCache]: Analyzing trace with hash -752924724, now seen corresponding path program 1 times [2024-09-12 19:16:28,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:16:28,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794505833] [2024-09-12 19:16:28,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:28,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:16:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,262 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:16:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,265 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:16:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,267 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:16:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 19:16:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 19:16:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-12 19:16:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-12 19:16:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-12 19:16:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 19:16:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-12 19:16:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-12 19:16:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-12 19:16:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-12 19:16:28,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:16:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794505833] [2024-09-12 19:16:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794505833] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:16:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700529085] [2024-09-12 19:16:28,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:28,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:16:28,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:16:28,314 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-12 19:16:28,316 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-12 19:16:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:28,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 19:16:28,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:16:28,456 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-09-12 19:16:28,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:16:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700529085] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:16:28,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:16:28,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2024-09-12 19:16:28,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964405362] [2024-09-12 19:16:28,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:16:28,528 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 19:16:28,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:16:28,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 19:16:28,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:16:28,530 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-12 19:16:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:16:28,876 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2024-09-12 19:16:28,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 19:16:28,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 72 [2024-09-12 19:16:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:16:28,878 INFO L225 Difference]: With dead ends: 102 [2024-09-12 19:16:28,878 INFO L226 Difference]: Without dead ends: 94 [2024-09-12 19:16:28,878 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-09-12 19:16:28,879 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 17 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:16:28,879 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 232 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:16:28,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-12 19:16:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-09-12 19:16:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 58 states have internal predecessors, (61), 26 states have call successors, (26), 13 states have call predecessors, (26), 12 states have return successors, (24), 21 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-12 19:16:28,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-09-12 19:16:28,908 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 72 [2024-09-12 19:16:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:16:28,908 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-09-12 19:16:28,908 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-09-12 19:16:28,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-09-12 19:16:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-12 19:16:28,910 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:16:28,910 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:16:28,927 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 19:16:29,114 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:16:29,115 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:16:29,115 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:16:29,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-12 19:16:29,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:16:29,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920868595] [2024-09-12 19:16:29,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:29,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:16:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 19:16:29,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699402770] [2024-09-12 19:16:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:16:29,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:16:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:16:29,179 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-12 19:16:29,181 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-12 19:16:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:16:29,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-12 19:16:29,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:16:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 54 proven. 23 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-09-12 19:16:30,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:17:05,430 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 19:17:17,218 WARN L293 SmtUtils]: Spent 7.60s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:17:33,240 WARN L293 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 19:18:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 7 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-09-12 19:18:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:18:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920868595] [2024-09-12 19:18:16,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 19:18:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699402770] [2024-09-12 19:18:16,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699402770] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:18:16,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:18:16,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2024-09-12 19:18:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321311223] [2024-09-12 19:18:16,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:18:16,106 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-12 19:18:16,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:18:16,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-12 19:18:16,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=464, Unknown=2, NotChecked=0, Total=552 [2024-09-12 19:18:16,107 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 18 states have internal predecessors, (41), 9 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) [2024-09-12 19:18:18,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:18:22,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:19:03,675 WARN L293 SmtUtils]: Spent 36.33s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 19:19:05,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:19:10,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:19:14,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:19:26,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:19:34,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:19:35,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:19:39,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:19:43,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:19:47,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:19:59,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:20:03,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:20:05,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:20:09,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:20:13,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:20:17,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:20:20,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 19:20:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:20:20,093 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2024-09-12 19:20:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-12 19:20:20,096 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 18 states have internal predecessors, (41), 9 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) Word has length 74 [2024-09-12 19:20:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:20:20,097 INFO L225 Difference]: With dead ends: 124 [2024-09-12 19:20:20,097 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 19:20:20,098 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 88.4s TimeCoverageRelationStatistics Valid=170, Invalid=815, Unknown=7, NotChecked=0, Total=992 [2024-09-12 19:20:20,098 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 55 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 62.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.7s IncrementalHoareTripleChecker+Time [2024-09-12 19:20:20,098 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 241 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 272 Invalid, 12 Unknown, 0 Unchecked, 62.7s Time] [2024-09-12 19:20:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 19:20:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 19:20:20,099 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-12 19:20:20,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 19:20:20,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2024-09-12 19:20:20,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:20:20,100 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 19:20:20,100 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 18 states have internal predecessors, (41), 9 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 9 states have call predecessors, (20), 7 states have call successors, (20) [2024-09-12 19:20:20,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:20:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 19:20:20,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 19:20:20,103 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 19:20:20,112 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 19:20:20,304 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 19:20:20,307 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:20:20,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 19:20:33,570 WARN L293 SmtUtils]: Spent 13.03s on a formula simplification. DAG size of input: 67 DAG size of output: 29 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 19:20:45,712 WARN L293 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 67 DAG size of output: 29 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 19:20:52,729 WARN L293 SmtUtils]: Spent 7.02s on a formula simplification. DAG size of input: 67 DAG size of output: 29 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-12 19:20:58,881 WARN L293 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 67 DAG size of output: 29 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)