./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.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 9851f41ad4fb2d0ff96507e8e48f0d2886a8de6481eed845b23377b9fa492b45 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 23:49:09,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:49:09,829 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:49:09,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:49:09,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:49:09,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:49:09,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:49:09,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:49:09,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:49:09,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:49:09,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:49:09,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:49:09,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:49:09,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:49:09,881 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:49:09,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:49:09,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:49:09,882 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:49:09,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:49:09,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:49:09,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:49:09,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:49:09,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:49:09,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:49:09,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:49:09,888 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:49:09,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:49:09,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:49:09,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:49:09,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:49:09,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:49:09,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:49:09,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:49:09,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:49:09,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:49:09,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:49:09,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:49:09,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:49:09,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:49:09,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:49:09,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:49:09,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:49:09,891 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 -> 9851f41ad4fb2d0ff96507e8e48f0d2886a8de6481eed845b23377b9fa492b45 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 23:49:10,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:49:10,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:49:10,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:49:10,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:49:10,174 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:49:10,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-24 23:49:11,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:49:11,809 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:49:11,811 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-24 23:49:11,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/65a084dd5/c497aa66c88d47f382291bbfa09f6a9b/FLAGb1b227136 [2024-09-24 23:49:12,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/65a084dd5/c497aa66c88d47f382291bbfa09f6a9b [2024-09-24 23:49:12,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:49:12,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:49:12,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:49:12,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:49:12,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:49:12,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e058ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12, skipping insertion in model container [2024-09-24 23:49:12,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:49:12,348 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2024-09-24 23:49:12,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:49:12,372 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:49:12,385 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2024-09-24 23:49:12,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:49:12,405 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:49:12,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12 WrapperNode [2024-09-24 23:49:12,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:49:12,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:49:12,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:49:12,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:49:12,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,424 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:49:12,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:49:12,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:49:12,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:49:12,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:49:12,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,454 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-24 23:49:12,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:49:12,469 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:49:12,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:49:12,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:49:12,470 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (1/1) ... [2024-09-24 23:49:12,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:49:12,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:12,501 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-24 23:49:12,503 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-24 23:49:12,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:49:12,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:49:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:49:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:49:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:49:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:49:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:49:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:49:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:49:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:49:12,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:49:12,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:49:12,591 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:49:12,593 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:49:12,755 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-24 23:49:12,755 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:49:12,783 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:49:12,783 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-24 23:49:12,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:49:12 BoogieIcfgContainer [2024-09-24 23:49:12,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:49:12,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:49:12,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:49:12,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:49:12,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:49:12" (1/3) ... [2024-09-24 23:49:12,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d996699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:49:12, skipping insertion in model container [2024-09-24 23:49:12,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:49:12" (2/3) ... [2024-09-24 23:49:12,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d996699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:49:12, skipping insertion in model container [2024-09-24 23:49:12,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:49:12" (3/3) ... [2024-09-24 23:49:12,797 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound2.c [2024-09-24 23:49:12,812 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:49:12,812 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:49:12,862 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:49:12,867 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;@35d24b06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:49:12,867 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:49:12,872 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-24 23:49:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-24 23:49:12,879 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:12,880 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-24 23:49:12,880 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:12,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:12,886 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-24 23:49:12,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:12,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370276874] [2024-09-24 23:49:12,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:12,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,077 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-24 23:49:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370276874] [2024-09-24 23:49:13,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370276874] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:49:13,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:49:13,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 23:49:13,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978424107] [2024-09-24 23:49:13,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:13,085 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 23:49:13,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:13,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 23:49:13,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 23:49:13,106 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-24 23:49:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:13,135 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-24 23:49:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 23:49:13,139 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-24 23:49:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:13,146 INFO L225 Difference]: With dead ends: 66 [2024-09-24 23:49:13,147 INFO L226 Difference]: Without dead ends: 32 [2024-09-24 23:49:13,151 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-24 23:49:13,155 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-24 23:49:13,157 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-24 23:49:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-24 23:49:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-24 23:49:13,187 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-24 23:49:13,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-24 23:49:13,190 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-24 23:49:13,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:13,190 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-24 23:49:13,191 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-24 23:49:13,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:13,192 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-24 23:49:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-24 23:49:13,193 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:13,193 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-24 23:49:13,193 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:49:13,194 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:13,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-24 23:49:13,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:13,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391026572] [2024-09-24 23:49:13,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,435 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,455 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-24 23:49:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391026572] [2024-09-24 23:49:13,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391026572] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:49:13,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:49:13,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:49:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072862709] [2024-09-24 23:49:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:13,461 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:49:13,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:49:13,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:49:13,465 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-24 23:49:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:13,540 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-24 23:49:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:49:13,543 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-24 23:49:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:13,544 INFO L225 Difference]: With dead ends: 45 [2024-09-24 23:49:13,544 INFO L226 Difference]: Without dead ends: 43 [2024-09-24 23:49:13,545 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-24 23:49:13,547 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.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:13,548 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.0s Time] [2024-09-24 23:49:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-24 23:49:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-24 23:49:13,565 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-24 23:49:13,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-24 23:49:13,568 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-24 23:49:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:13,569 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-24 23:49:13,569 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-24 23:49:13,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-24 23:49:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-24 23:49:13,570 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:13,571 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-24 23:49:13,571 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 23:49:13,571 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:13,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:13,573 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-24 23:49:13,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945553949] [2024-09-24 23:49:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:13,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,708 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,717 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:49:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:13,749 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-24 23:49:13,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945553949] [2024-09-24 23:49:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945553949] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:49:13,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:49:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:49:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973306872] [2024-09-24 23:49:13,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:13,755 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:49:13,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:13,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:49:13,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:49:13,757 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-24 23:49:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:13,869 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-24 23:49:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:49:13,870 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-24 23:49:13,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:13,872 INFO L225 Difference]: With dead ends: 49 [2024-09-24 23:49:13,873 INFO L226 Difference]: Without dead ends: 47 [2024-09-24 23:49:13,874 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 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-24 23:49:13,875 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-24 23:49:13,877 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-24 23:49:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-24 23:49:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-24 23:49:13,890 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-24 23:49:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-24 23:49:13,893 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-24 23:49:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:13,893 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-24 23:49:13,894 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-24 23:49:13,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-24 23:49:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-24 23:49:13,897 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:13,897 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-24 23:49:13,897 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 23:49:13,897 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:13,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-24 23:49:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:13,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541144405] [2024-09-24 23:49:13,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:13,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:13,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206071013] [2024-09-24 23:49:13,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:13,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:13,938 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-24 23:49:13,940 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-24 23:49:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:14,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-24 23:49:14,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-24 23:49:14,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:49:14,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:14,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541144405] [2024-09-24 23:49:14,106 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:49:14,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206071013] [2024-09-24 23:49:14,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206071013] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:49:14,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:49:14,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:49:14,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389235041] [2024-09-24 23:49:14,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:14,107 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:49:14,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:14,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:49:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:49:14,112 INFO L87 Difference]: Start difference. First operand 40 states and 48 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:49:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:14,194 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-24 23:49:14,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:49:14,195 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-09-24 23:49:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:14,196 INFO L225 Difference]: With dead ends: 66 [2024-09-24 23:49:14,196 INFO L226 Difference]: Without dead ends: 53 [2024-09-24 23:49:14,197 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-24 23:49:14,197 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:14,198 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:49:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-24 23:49:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-24 23:49:14,209 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-24 23:49:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-24 23:49:14,214 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-24 23:49:14,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:14,215 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-24 23:49:14,215 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-24 23:49:14,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-24 23:49:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-24 23:49:14,216 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:14,216 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-24 23:49:14,237 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-24 23:49:14,417 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-24 23:49:14,417 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:14,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-24 23:49:14,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:14,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310193972] [2024-09-24 23:49:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:14,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:14,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2099743938] [2024-09-24 23:49:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:14,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:14,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:14,436 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-24 23:49:14,441 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-24 23:49:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:14,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-24 23:49:14,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-24 23:49:14,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-24 23:49:14,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:14,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310193972] [2024-09-24 23:49:14,846 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:49:14,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099743938] [2024-09-24 23:49:14,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099743938] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:49:14,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:49:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-24 23:49:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482524739] [2024-09-24 23:49:14,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:14,849 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-24 23:49:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-24 23:49:14,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-24 23:49:14,853 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-24 23:49:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:14,975 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-09-24 23:49:14,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-24 23:49:14,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-09-24 23:49:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:14,980 INFO L225 Difference]: With dead ends: 68 [2024-09-24 23:49:14,981 INFO L226 Difference]: Without dead ends: 66 [2024-09-24 23:49:14,982 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-24 23:49:14,982 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:14,983 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 23:49:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-24 23:49:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-09-24 23:49:14,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-24 23:49:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-09-24 23:49:15,001 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 44 [2024-09-24 23:49:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:15,002 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-09-24 23:49:15,003 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-24 23:49:15,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:15,003 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-09-24 23:49:15,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-24 23:49:15,006 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:15,006 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-24 23:49:15,023 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 23:49:15,206 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-24 23:49:15,207 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:15,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-24 23:49:15,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:15,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76658813] [2024-09-24 23:49:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:15,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1427750588] [2024-09-24 23:49:15,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:15,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:15,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:15,236 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-24 23:49:15,237 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-24 23:49:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-24 23:49:15,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:15,383 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-24 23:49:15,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-24 23:49:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76658813] [2024-09-24 23:49:15,473 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:49:15,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427750588] [2024-09-24 23:49:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427750588] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-24 23:49:15,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:49:15,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-24 23:49:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363420095] [2024-09-24 23:49:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:15,474 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:49:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:49:15,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-24 23:49:15,475 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-24 23:49:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:15,549 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-09-24 23:49:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:49:15,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-09-24 23:49:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:15,551 INFO L225 Difference]: With dead ends: 73 [2024-09-24 23:49:15,551 INFO L226 Difference]: Without dead ends: 71 [2024-09-24 23:49:15,551 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-24 23:49:15,552 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:15,553 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:49:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-24 23:49:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-24 23:49:15,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-24 23:49:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-09-24 23:49:15,580 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2024-09-24 23:49:15,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:15,581 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-09-24 23:49:15,581 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-24 23:49:15,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-09-24 23:49:15,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-24 23:49:15,583 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:15,583 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:15,599 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-24 23:49:15,783 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-24 23:49:15,784 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:15,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash 515743006, now seen corresponding path program 1 times [2024-09-24 23:49:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575753788] [2024-09-24 23:49:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,915 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,918 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:49:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:49:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,934 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:49:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,940 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-24 23:49:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-24 23:49:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-24 23:49:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-24 23:49:15,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:15,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575753788] [2024-09-24 23:49:15,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575753788] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:49:15,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:49:15,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:49:15,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253224116] [2024-09-24 23:49:15,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:15,966 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:49:15,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:15,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:49:15,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:49:15,967 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-24 23:49:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:16,032 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-09-24 23:49:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:49:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2024-09-24 23:49:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:16,034 INFO L225 Difference]: With dead ends: 78 [2024-09-24 23:49:16,034 INFO L226 Difference]: Without dead ends: 66 [2024-09-24 23:49:16,034 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:49:16,035 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:16,036 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:49:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-24 23:49:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-24 23:49:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-24 23:49:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-09-24 23:49:16,052 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2024-09-24 23:49:16,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:16,053 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-09-24 23:49:16,053 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-24 23:49:16,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-09-24 23:49:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-24 23:49:16,056 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:16,056 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-24 23:49:16,056 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-24 23:49:16,057 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:16,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-24 23:49:16,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:16,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202029158] [2024-09-24 23:49:16,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:16,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:16,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312103680] [2024-09-24 23:49:16,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:16,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:16,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:16,091 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-24 23:49:16,092 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-24 23:49:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:16,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-24 23:49:16,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-09-24 23:49:16,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-24 23:49:18,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202029158] [2024-09-24 23:49:18,676 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:49:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312103680] [2024-09-24 23:49:18,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312103680] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:49:18,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:49:18,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-24 23:49:18,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724418646] [2024-09-24 23:49:18,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:18,679 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-24 23:49:18,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:18,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-24 23:49:18,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-09-24 23:49:18,682 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 9 states have call predecessors, (23), 8 states have call successors, (23) [2024-09-24 23:49:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:20,034 INFO L93 Difference]: Finished difference Result 152 states and 208 transitions. [2024-09-24 23:49:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-24 23:49:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 9 states have call predecessors, (23), 8 states have call successors, (23) Word has length 74 [2024-09-24 23:49:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:20,038 INFO L225 Difference]: With dead ends: 152 [2024-09-24 23:49:20,039 INFO L226 Difference]: Without dead ends: 129 [2024-09-24 23:49:20,040 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2024-09-24 23:49:20,040 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 73 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:20,041 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 308 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-24 23:49:20,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-09-24 23:49:20,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2024-09-24 23:49:20,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-09-24 23:49:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2024-09-24 23:49:20,087 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 74 [2024-09-24 23:49:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:20,087 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2024-09-24 23:49:20,088 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 9 states have call predecessors, (23), 8 states have call successors, (23) [2024-09-24 23:49:20,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2024-09-24 23:49:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-24 23:49:20,089 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:20,089 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:20,107 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-24 23:49:20,293 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:20,294 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:20,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-09-24 23:49:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875509852] [2024-09-24 23:49:20,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:20,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949701314] [2024-09-24 23:49:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:20,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:20,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:20,330 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-24 23:49:20,331 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-24 23:49:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:20,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-24 23:49:20,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-09-24 23:49:20,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:21,438 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-24 23:49:21,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:21,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875509852] [2024-09-24 23:49:21,440 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:49:21,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949701314] [2024-09-24 23:49:21,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949701314] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:49:21,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:49:21,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-24 23:49:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477730706] [2024-09-24 23:49:21,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:21,441 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-24 23:49:21,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:21,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-24 23:49:21,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-09-24 23:49:21,444 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-24 23:49:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:21,984 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2024-09-24 23:49:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 23:49:21,984 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) Word has length 85 [2024-09-24 23:49:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:21,986 INFO L225 Difference]: With dead ends: 145 [2024-09-24 23:49:21,986 INFO L226 Difference]: Without dead ends: 111 [2024-09-24 23:49:21,987 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2024-09-24 23:49:21,988 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 26 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:21,988 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 350 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-24 23:49:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-24 23:49:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-09-24 23:49:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 59 states have internal predecessors, (66), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-24 23:49:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-09-24 23:49:22,024 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 85 [2024-09-24 23:49:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:22,024 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-09-24 23:49:22,025 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-24 23:49:22,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-09-24 23:49:22,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-24 23:49:22,026 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:22,026 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:22,044 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-24 23:49:22,230 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:22,231 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:22,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:22,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1973508941, now seen corresponding path program 2 times [2024-09-24 23:49:22,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:22,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370115836] [2024-09-24 23:49:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:22,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:49:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:49:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:49:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-24 23:49:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-24 23:49:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-24 23:49:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,402 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-24 23:49:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,406 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-24 23:49:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-24 23:49:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,414 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-24 23:49:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-24 23:49:22,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370115836] [2024-09-24 23:49:22,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370115836] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:49:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18230657] [2024-09-24 23:49:22,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 23:49:22,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:22,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:22,420 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:49:22,422 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-24 23:49:22,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 23:49:22,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:49:22,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-24 23:49:22,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-24 23:49:22,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:22,618 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-24 23:49:22,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18230657] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:49:22,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:49:22,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-09-24 23:49:22,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737255426] [2024-09-24 23:49:22,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:22,619 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:49:22,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:22,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:49:22,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:49:22,620 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-09-24 23:49:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:22,712 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2024-09-24 23:49:22,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 23:49:22,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 87 [2024-09-24 23:49:22,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:22,717 INFO L225 Difference]: With dead ends: 124 [2024-09-24 23:49:22,718 INFO L226 Difference]: Without dead ends: 102 [2024-09-24 23:49:22,718 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:49:22,719 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:22,719 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:49:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-24 23:49:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-09-24 23:49:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-24 23:49:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-09-24 23:49:22,762 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 87 [2024-09-24 23:49:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:22,762 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-09-24 23:49:22,763 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-09-24 23:49:22,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-09-24 23:49:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-24 23:49:22,764 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:22,764 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:22,781 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-24 23:49:22,964 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-24 23:49:22,965 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:22,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash -637517709, now seen corresponding path program 1 times [2024-09-24 23:49:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:22,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741389955] [2024-09-24 23:49:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:49:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:49:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:49:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-24 23:49:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-24 23:49:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-24 23:49:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,243 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-24 23:49:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-24 23:49:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-24 23:49:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-24 23:49:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-24 23:49:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,262 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-24 23:49:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741389955] [2024-09-24 23:49:23,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741389955] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:49:23,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658191000] [2024-09-24 23:49:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:23,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:23,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:23,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:49:23,266 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-24 23:49:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:23,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-24 23:49:23,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-09-24 23:49:23,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-24 23:49:24,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658191000] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:49:24,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:49:24,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 18 [2024-09-24 23:49:24,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286852281] [2024-09-24 23:49:24,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:24,002 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-24 23:49:24,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:24,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-24 23:49:24,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-24 23:49:24,004 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-24 23:49:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:24,399 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2024-09-24 23:49:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 23:49:24,400 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) Word has length 90 [2024-09-24 23:49:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:24,401 INFO L225 Difference]: With dead ends: 117 [2024-09-24 23:49:24,401 INFO L226 Difference]: Without dead ends: 100 [2024-09-24 23:49:24,402 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-09-24 23:49:24,402 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:24,402 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 389 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-24 23:49:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-24 23:49:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-09-24 23:49:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-24 23:49:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-09-24 23:49:24,430 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 90 [2024-09-24 23:49:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:24,430 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-09-24 23:49:24,430 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-24 23:49:24,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-09-24 23:49:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-24 23:49:24,432 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:24,432 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:24,448 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-24 23:49:24,635 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:24,636 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:24,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:24,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1204328542, now seen corresponding path program 1 times [2024-09-24 23:49:24,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:24,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480843537] [2024-09-24 23:49:24,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:24,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,702 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,708 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:49:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:49:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,713 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:49:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-24 23:49:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-24 23:49:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-24 23:49:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-24 23:49:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-24 23:49:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-24 23:49:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,737 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-24 23:49:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-24 23:49:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-24 23:49:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-24 23:49:24,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:24,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480843537] [2024-09-24 23:49:24,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480843537] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:49:24,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204827386] [2024-09-24 23:49:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:24,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:24,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:24,750 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:49:24,752 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-24 23:49:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:24,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-24 23:49:24,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-24 23:49:24,840 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:49:24,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204827386] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:49:24,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:49:24,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-09-24 23:49:24,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473875720] [2024-09-24 23:49:24,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:49:24,841 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:49:24,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:24,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:49:24,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:49:24,843 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-24 23:49:24,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:24,907 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-09-24 23:49:24,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 23:49:24,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 94 [2024-09-24 23:49:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:24,909 INFO L225 Difference]: With dead ends: 100 [2024-09-24 23:49:24,909 INFO L226 Difference]: Without dead ends: 88 [2024-09-24 23:49:24,909 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:49:24,910 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:24,910 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 120 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:49:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-24 23:49:24,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-24 23:49:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-24 23:49:24,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2024-09-24 23:49:24,936 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 94 [2024-09-24 23:49:24,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:24,936 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2024-09-24 23:49:24,936 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-24 23:49:24,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2024-09-24 23:49:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-09-24 23:49:24,937 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:24,937 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:24,954 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-24 23:49:25,141 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:25,142 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:25,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash -588826413, now seen corresponding path program 3 times [2024-09-24 23:49:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:25,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052127874] [2024-09-24 23:49:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:25,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:49:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,699 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:49:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:49:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-24 23:49:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-24 23:49:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-24 23:49:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-24 23:49:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-24 23:49:25,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-24 23:49:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,800 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-24 23:49:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-24 23:49:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-24 23:49:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-24 23:49:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-24 23:49:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052127874] [2024-09-24 23:49:25,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052127874] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:49:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305748300] [2024-09-24 23:49:25,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-24 23:49:25,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:25,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:25,833 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:49:25,835 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-24 23:49:25,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-24 23:49:25,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:49:25,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-24 23:49:25,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-24 23:49:26,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-24 23:49:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305748300] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:49:27,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:49:27,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-09-24 23:49:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859974241] [2024-09-24 23:49:27,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:27,168 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-24 23:49:27,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:27,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-24 23:49:27,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-09-24 23:49:27,169 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 23 states have internal predecessors, (57), 16 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) [2024-09-24 23:49:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:27,771 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2024-09-24 23:49:27,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-24 23:49:27,773 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 23 states have internal predecessors, (57), 16 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) Word has length 104 [2024-09-24 23:49:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:27,775 INFO L225 Difference]: With dead ends: 153 [2024-09-24 23:49:27,776 INFO L226 Difference]: Without dead ends: 101 [2024-09-24 23:49:27,777 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2024-09-24 23:49:27,778 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 50 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:27,778 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 502 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-24 23:49:27,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-24 23:49:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2024-09-24 23:49:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-24 23:49:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2024-09-24 23:49:27,818 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 104 [2024-09-24 23:49:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:27,819 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2024-09-24 23:49:27,819 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 23 states have internal predecessors, (57), 16 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) [2024-09-24 23:49:27,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2024-09-24 23:49:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-24 23:49:27,820 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:27,820 INFO L216 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:27,828 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-24 23:49:28,021 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-24 23:49:28,021 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:28,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:28,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1394769075, now seen corresponding path program 1 times [2024-09-24 23:49:28,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:28,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866494684] [2024-09-24 23:49:28,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:28,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:28,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560406623] [2024-09-24 23:49:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:28,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:28,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:28,050 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:49:28,062 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-24 23:49:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:28,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-24 23:49:28,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-09-24 23:49:28,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:30,745 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-09-24 23:49:30,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866494684] [2024-09-24 23:49:30,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:49:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560406623] [2024-09-24 23:49:30,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560406623] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:49:30,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-24 23:49:30,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 29 [2024-09-24 23:49:30,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241948945] [2024-09-24 23:49:30,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:30,747 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-24 23:49:30,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:30,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-24 23:49:30,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-09-24 23:49:30,749 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 16 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35) [2024-09-24 23:49:31,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:31,584 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2024-09-24 23:49:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-24 23:49:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 16 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35) Word has length 109 [2024-09-24 23:49:31,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:31,586 INFO L225 Difference]: With dead ends: 117 [2024-09-24 23:49:31,586 INFO L226 Difference]: Without dead ends: 95 [2024-09-24 23:49:31,587 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2024-09-24 23:49:31,587 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:31,588 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 473 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-24 23:49:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-24 23:49:31,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-09-24 23:49:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-24 23:49:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-09-24 23:49:31,620 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 109 [2024-09-24 23:49:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:31,621 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-09-24 23:49:31,621 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 16 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35) [2024-09-24 23:49:31,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-09-24 23:49:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-24 23:49:31,624 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:31,624 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-09-24 23:49:31,640 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-24 23:49:31,824 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-24 23:49:31,825 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:31,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash 733497000, now seen corresponding path program 1 times [2024-09-24 23:49:31,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460717990] [2024-09-24 23:49:31,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-24 23:49:31,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1458290061] [2024-09-24 23:49:31,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:31,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:31,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:31,869 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:49:31,871 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-24 23:49:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:31,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-24 23:49:31,943 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 64 proven. 72 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-09-24 23:49:32,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:34,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:34,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460717990] [2024-09-24 23:49:34,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-24 23:49:34,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458290061] [2024-09-24 23:49:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458290061] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:49:34,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:49:34,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-09-24 23:49:34,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812282865] [2024-09-24 23:49:34,105 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:34,106 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-24 23:49:34,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:34,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-24 23:49:34,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-09-24 23:49:34,107 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2024-09-24 23:49:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:34,560 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-09-24 23:49:34,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-24 23:49:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) Word has length 115 [2024-09-24 23:49:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:34,562 INFO L225 Difference]: With dead ends: 101 [2024-09-24 23:49:34,562 INFO L226 Difference]: Without dead ends: 97 [2024-09-24 23:49:34,562 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2024-09-24 23:49:34,564 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:34,564 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 405 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-24 23:49:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-24 23:49:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-09-24 23:49:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.0) internal successors, (60), 60 states have internal predecessors, (60), 22 states have call successors, (22), 16 states have call predecessors, (22), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-24 23:49:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-09-24 23:49:34,595 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 115 [2024-09-24 23:49:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:34,596 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-09-24 23:49:34,596 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2024-09-24 23:49:34,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:34,596 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-09-24 23:49:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-09-24 23:49:34,597 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:49:34,598 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2024-09-24 23:49:34,615 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-24 23:49:34,798 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-24 23:49:34,799 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:49:34,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:34,799 INFO L85 PathProgramCache]: Analyzing trace with hash 265983484, now seen corresponding path program 1 times [2024-09-24 23:49:34,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:49:34,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502018004] [2024-09-24 23:49:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:34,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:49:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:49:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:49:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,137 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:49:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,139 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-24 23:49:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:49:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-24 23:49:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,145 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-24 23:49:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-24 23:49:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-24 23:49:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-24 23:49:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-24 23:49:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-24 23:49:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-24 23:49:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-24 23:49:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-24 23:49:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-24 23:49:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-24 23:49:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-24 23:49:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-24 23:49:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-24 23:49:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-24 23:49:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:49:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502018004] [2024-09-24 23:49:35,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502018004] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:49:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696306987] [2024-09-24 23:49:35,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:49:35,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:49:35,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:49:35,186 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 23:49:35,188 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-24 23:49:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:49:35,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-24 23:49:35,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:49:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 31 proven. 74 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-24 23:49:35,600 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:49:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 31 proven. 74 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-24 23:49:36,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696306987] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:49:36,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:49:36,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 26 [2024-09-24 23:49:36,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995584109] [2024-09-24 23:49:36,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:49:36,444 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-24 23:49:36,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:49:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-24 23:49:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-09-24 23:49:36,446 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 17 states have call predecessors, (49), 19 states have call successors, (49) [2024-09-24 23:49:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:49:36,811 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-09-24 23:49:36,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-24 23:49:36,812 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 17 states have call predecessors, (49), 19 states have call successors, (49) Word has length 120 [2024-09-24 23:49:36,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:49:36,812 INFO L225 Difference]: With dead ends: 97 [2024-09-24 23:49:36,812 INFO L226 Difference]: Without dead ends: 0 [2024-09-24 23:49:36,813 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2024-09-24 23:49:36,813 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-24 23:49:36,813 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 354 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-24 23:49:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-24 23:49:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-24 23:49:36,814 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-24 23:49:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-24 23:49:36,814 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-09-24 23:49:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:49:36,814 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-24 23:49:36,815 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 17 states have call predecessors, (49), 19 states have call successors, (49) [2024-09-24 23:49:36,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:49:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-24 23:49:36,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-24 23:49:36,817 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-24 23:49:36,829 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-24 23:49:37,018 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-24 23:49:37,021 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:49:37,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-24 23:49:38,811 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-24 23:49:38,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 11:49:38 BoogieIcfgContainer [2024-09-24 23:49:38,833 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-24 23:49:38,833 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-24 23:49:38,833 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-24 23:49:38,834 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-24 23:49:38,834 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:49:12" (3/4) ... [2024-09-24 23:49:38,836 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-24 23:49:38,891 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-24 23:49:38,892 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-24 23:49:38,892 INFO L158 Benchmark]: Toolchain (without parser) took 26713.07ms. Allocated memory was 174.1MB in the beginning and 314.6MB in the end (delta: 140.5MB). Free memory was 140.2MB in the beginning and 132.0MB in the end (delta: 8.2MB). Peak memory consumption was 149.4MB. Max. memory is 16.1GB. [2024-09-24 23:49:38,893 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 23:49:38,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.95ms. Allocated memory is still 174.1MB. Free memory was 140.2MB in the beginning and 128.4MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-24 23:49:38,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.69ms. Allocated memory is still 174.1MB. Free memory was 128.4MB in the beginning and 126.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:49:38,894 INFO L158 Benchmark]: Boogie Preprocessor took 42.18ms. Allocated memory is still 174.1MB. Free memory was 126.9MB in the beginning and 125.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:49:38,894 INFO L158 Benchmark]: RCFGBuilder took 315.20ms. Allocated memory is still 174.1MB. Free memory was 125.5MB in the beginning and 111.6MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-24 23:49:38,896 INFO L158 Benchmark]: TraceAbstraction took 26045.06ms. Allocated memory was 174.1MB in the beginning and 314.6MB in the end (delta: 140.5MB). Free memory was 110.8MB in the beginning and 134.1MB in the end (delta: -23.2MB). Peak memory consumption was 160.0MB. Max. memory is 16.1GB. [2024-09-24 23:49:38,896 INFO L158 Benchmark]: Witness Printer took 58.23ms. Allocated memory is still 314.6MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:49:38,898 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 174.1MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.95ms. Allocated memory is still 174.1MB. Free memory was 140.2MB in the beginning and 128.4MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.69ms. Allocated memory is still 174.1MB. Free memory was 128.4MB in the beginning and 126.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.18ms. Allocated memory is still 174.1MB. Free memory was 126.9MB in the beginning and 125.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 315.20ms. Allocated memory is still 174.1MB. Free memory was 125.5MB in the beginning and 111.6MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26045.06ms. Allocated memory was 174.1MB in the beginning and 314.6MB in the end (delta: 140.5MB). Free memory was 110.8MB in the beginning and 134.1MB in the end (delta: -23.2MB). Peak memory consumption was 160.0MB. Max. memory is 16.1GB. * Witness Printer took 58.23ms. Allocated memory is still 314.6MB. Free memory was 134.1MB in the beginning and 132.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.2s, OverallIterations: 16, TraceHistogramMax: 17, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 3912 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3270 mSDsCounter, 326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2541 IncrementalHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 326 mSolverCounterUnsat, 642 mSDtfsCounter, 2541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2120 GetRequests, 1884 SyntacticMatches, 6 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=8, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 75 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 2172 NumberOfCodeBlocks, 2145 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2391 ConstructedInterpolants, 0 QuantifiedInterpolants, 15679 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2175 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 6714/7295 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((0 <= r) && (((__int128) r + 1) <= d)) && (((__int128) d + r) == A)) && (((__int128) r + ((long long) 2 * B)) == ((__int128) A + d))) && (q == 1)) && (A <= 2)) && (p == 1)) || ((((((B == 1) && (r == 0)) && (q == 2)) && (p == 2)) && (A == 2)) && (d == 2))) || (((((((A == r) && (d == ((long long) 2 * B))) && (((__int128) r + 1) <= d)) && (p == 2)) && (q == 0)) && (A <= 2)) && (B <= r))) || ((((((B == 1) && (r == 0)) && (q == 2)) && (A == 2)) && (d == 1)) && (p == 1))) || ((((d == B) && (A == r)) && (q == 0)) && (p == 1))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((__int128) A + d) == ((__int128) ((long long) B * 4) + r))) && (q == 0)) && (p == 4)) && ((A + (d / 2)) == ((__int128) r + ((long long) 2 * B)))) && (1 <= d)) && (A <= 2))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((d == B) && (A == r)) && (q == 0)) && (1 <= d)) && (A <= 2)) && (p == 1)) || (((((((A == r) && (d == ((long long) 2 * B))) && (p == 2)) && (q == 0)) && (1 <= d)) && (A <= 2)) && (B <= r))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((__int128) A + d) == ((__int128) ((long long) B * 4) + r))) && (q == 0)) && (p == 4)) && ((A + (d / 2)) == ((__int128) r + ((long long) 2 * B)))) && (1 <= d)) && (A <= 2))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-24 23:49:38,964 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE