./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound20.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound20.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 41de47755c46f2f4de69961f8458c254f5c62632809005d7de26bd26c8032b2a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-13 01:02:01,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 01:02:01,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 01:02:01,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 01:02:01,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 01:02:01,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 01:02:01,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 01:02:01,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 01:02:01,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 01:02:01,772 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 01:02:01,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 01:02:01,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 01:02:01,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 01:02:01,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 01:02:01,774 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 01:02:01,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 01:02:01,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 01:02:01,777 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 01:02:01,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 01:02:01,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 01:02:01,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 01:02:01,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 01:02:01,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 01:02:01,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 01:02:01,779 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 01:02:01,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 01:02:01,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 01:02:01,780 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 01:02:01,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 01:02:01,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 01:02:01,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 01:02:01,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 01:02:01,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:02:01,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 01:02:01,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 01:02:01,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 01:02:01,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 01:02:01,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 01:02:01,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 01:02:01,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 01:02:01,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 01:02:01,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 01:02:01,785 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 -> 41de47755c46f2f4de69961f8458c254f5c62632809005d7de26bd26c8032b2a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 01:02:02,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 01:02:02,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 01:02:02,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 01:02:02,072 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 01:02:02,073 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 01:02:02,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound20.c [2024-09-13 01:02:03,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 01:02:03,658 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 01:02:03,659 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound20.c [2024-09-13 01:02:03,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/69b2c9874/88a4710b666a440db64d58dd7e4e9df0/FLAG6d26fb8bf [2024-09-13 01:02:03,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/69b2c9874/88a4710b666a440db64d58dd7e4e9df0 [2024-09-13 01:02:03,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 01:02:03,701 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 01:02:03,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 01:02:03,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 01:02:03,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 01:02:03,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5ff0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03, skipping insertion in model container [2024-09-13 01:02:03,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,755 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 01:02:03,875 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound20.c[546,559] [2024-09-13 01:02:03,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:02:03,899 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 01:02:03,911 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound20.c[546,559] [2024-09-13 01:02:03,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:02:03,930 INFO L204 MainTranslator]: Completed translation [2024-09-13 01:02:03,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03 WrapperNode [2024-09-13 01:02:03,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 01:02:03,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 01:02:03,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 01:02:03,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 01:02:03,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,950 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 01:02:03,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 01:02:03,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 01:02:03,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 01:02:03,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 01:02:03,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,972 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-13 01:02:03,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 01:02:03,983 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 01:02:03,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 01:02:03,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 01:02:03,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (1/1) ... [2024-09-13 01:02:03,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:02:04,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:02:04,015 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-13 01:02:04,018 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-13 01:02:04,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 01:02:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 01:02:04,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 01:02:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 01:02:04,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 01:02:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 01:02:04,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 01:02:04,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 01:02:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 01:02:04,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 01:02:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 01:02:04,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 01:02:04,137 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 01:02:04,139 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 01:02:04,329 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-13 01:02:04,330 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 01:02:04,346 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 01:02:04,347 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-13 01:02:04,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:02:04 BoogieIcfgContainer [2024-09-13 01:02:04,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 01:02:04,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 01:02:04,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 01:02:04,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 01:02:04,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 01:02:03" (1/3) ... [2024-09-13 01:02:04,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa3674a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:02:04, skipping insertion in model container [2024-09-13 01:02:04,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:02:03" (2/3) ... [2024-09-13 01:02:04,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa3674a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:02:04, skipping insertion in model container [2024-09-13 01:02:04,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:02:04" (3/3) ... [2024-09-13 01:02:04,355 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound20.c [2024-09-13 01:02:04,368 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 01:02:04,369 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 01:02:04,412 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 01:02:04,418 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;@15876e6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 01:02:04,419 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 01:02:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 01:02:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 01:02:04,431 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:02:04,432 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:02:04,432 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:02:04,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:04,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1666515900, now seen corresponding path program 1 times [2024-09-13 01:02:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:02:04,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535775576] [2024-09-13 01:02:04,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:04,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:02:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:04,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:02:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:04,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:02:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:04,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 01:02:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:04,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:02:04,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535775576] [2024-09-13 01:02:04,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535775576] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:02:04,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:02:04,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-13 01:02:04,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171824791] [2024-09-13 01:02:04,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:02:04,665 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-13 01:02:04,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:02:04,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-13 01:02:04,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 01:02:04,694 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 01:02:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:02:04,776 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2024-09-13 01:02:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-13 01:02:04,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-13 01:02:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:02:04,786 INFO L225 Difference]: With dead ends: 51 [2024-09-13 01:02:04,786 INFO L226 Difference]: Without dead ends: 25 [2024-09-13 01:02:04,789 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-13 01:02:04,792 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:02:04,793 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:02:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-13 01:02:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-09-13 01:02:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 01:02:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-09-13 01:02:04,827 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2024-09-13 01:02:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:02:04,828 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-09-13 01:02:04,828 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 01:02:04,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-09-13 01:02:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 01:02:04,831 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:02:04,831 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:02:04,832 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 01:02:04,832 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:02:04,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash -387848543, now seen corresponding path program 1 times [2024-09-13 01:02:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:02:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537478783] [2024-09-13 01:02:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:04,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:02:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:02:04,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216344448] [2024-09-13 01:02:04,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:04,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:02:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:02:04,883 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-13 01:02:04,885 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-13 01:02:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:04,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-13 01:02:04,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:02:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:05,054 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 01:02:05,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:02:05,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537478783] [2024-09-13 01:02:05,055 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:02:05,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216344448] [2024-09-13 01:02:05,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216344448] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:02:05,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:02:05,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:02:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664228590] [2024-09-13 01:02:05,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:02:05,060 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:02:05,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:02:05,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:02:05,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:02:05,061 INFO L87 Difference]: Start difference. First operand 24 states and 27 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 01:02:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:02:05,118 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-09-13 01:02:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:02:05,120 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-09-13 01:02:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:02:05,121 INFO L225 Difference]: With dead ends: 35 [2024-09-13 01:02:05,121 INFO L226 Difference]: Without dead ends: 33 [2024-09-13 01:02:05,122 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:02:05,123 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 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-13 01:02:05,123 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:02:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-13 01:02:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-09-13 01:02:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 01:02:05,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-13 01:02:05,134 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2024-09-13 01:02:05,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:02:05,135 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-13 01:02:05,136 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 01:02:05,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:05,137 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-13 01:02:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 01:02:05,137 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:02:05,137 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:02:05,150 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 01:02:05,338 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:02:05,339 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:02:05,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash 783720481, now seen corresponding path program 1 times [2024-09-13 01:02:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:02:05,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121345988] [2024-09-13 01:02:05,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:02:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:05,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:02:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:05,581 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:02:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:05,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 01:02:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:05,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:02:05,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121345988] [2024-09-13 01:02:05,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121345988] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:02:05,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:02:05,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:02:05,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876614058] [2024-09-13 01:02:05,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:02:05,603 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:02:05,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:02:05,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:02:05,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:02:05,604 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 01:02:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:02:05,696 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-09-13 01:02:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-13 01:02:05,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-13 01:02:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:02:05,699 INFO L225 Difference]: With dead ends: 39 [2024-09-13 01:02:05,699 INFO L226 Difference]: Without dead ends: 31 [2024-09-13 01:02:05,700 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:02:05,701 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:02:05,701 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:02:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-13 01:02:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-13 01:02:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-13 01:02:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-09-13 01:02:05,713 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 23 [2024-09-13 01:02:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:02:05,714 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-09-13 01:02:05,714 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 01:02:05,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-09-13 01:02:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 01:02:05,716 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:02:05,716 INFO L216 NwaCegarLoop]: trace histogram [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-13 01:02:05,716 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 01:02:05,716 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:02:05,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1293449266, now seen corresponding path program 1 times [2024-09-13 01:02:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:02:05,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803406435] [2024-09-13 01:02:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:05,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:02:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:05,993 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:02:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:05,999 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:02:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:06,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 01:02:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:06,008 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 01:02:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:06,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:06,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:02:06,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803406435] [2024-09-13 01:02:06,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803406435] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:02:06,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555248451] [2024-09-13 01:02:06,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:06,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:02:06,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:02:06,049 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-13 01:02:06,051 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-13 01:02:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:06,102 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-13 01:02:06,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:02:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:06,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:02:06,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:02:06,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555248451] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:02:06,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:02:06,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2024-09-13 01:02:06,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672293491] [2024-09-13 01:02:06,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:02:06,606 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 01:02:06,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:02:06,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 01:02:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-09-13 01:02:06,610 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 01:02:11,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:02:11,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:02:11,148 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-09-13 01:02:11,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 01:02:11,149 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 29 [2024-09-13 01:02:11,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:02:11,150 INFO L225 Difference]: With dead ends: 45 [2024-09-13 01:02:11,152 INFO L226 Difference]: Without dead ends: 39 [2024-09-13 01:02:11,153 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-09-13 01:02:11,153 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-09-13 01:02:11,154 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 101 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-09-13 01:02:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-13 01:02:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-13 01:02:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.08) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-13 01:02:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-09-13 01:02:11,175 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2024-09-13 01:02:11,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:02:11,176 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-09-13 01:02:11,176 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 01:02:11,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-09-13 01:02:11,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-13 01:02:11,179 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:02:11,179 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:02:11,196 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 01:02:11,380 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:02:11,380 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:02:11,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:02:11,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1959775791, now seen corresponding path program 1 times [2024-09-13 01:02:11,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:02:11,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781896326] [2024-09-13 01:02:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:11,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:02:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:02:11,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100227481] [2024-09-13 01:02:11,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:02:11,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:02:11,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:02:11,426 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-13 01:02:11,428 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-13 01:02:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:02:11,495 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-13 01:02:11,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:02:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 01:02:11,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:02:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 10 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 01:02:27,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:02:27,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781896326] [2024-09-13 01:02:27,067 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:02:27,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100227481] [2024-09-13 01:02:27,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100227481] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:02:27,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:02:27,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-09-13 01:02:27,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729183383] [2024-09-13 01:02:27,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:02:27,069 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-13 01:02:27,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:02:27,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-13 01:02:27,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=166, Unknown=3, NotChecked=0, Total=210 [2024-09-13 01:02:27,071 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-13 01:02:40,975 WARN L293 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:02:45,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:02:58,886 WARN L293 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:03:02,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:06,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:10,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:14,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:18,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:22,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:42,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:46,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:50,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:55,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:03:59,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:03,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:07,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:11,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:15,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:19,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:23,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:04:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:04:23,289 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2024-09-13 01:04:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 01:04:23,290 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 38 [2024-09-13 01:04:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:04:23,292 INFO L225 Difference]: With dead ends: 66 [2024-09-13 01:04:23,292 INFO L226 Difference]: Without dead ends: 64 [2024-09-13 01:04:23,292 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 58.1s TimeCoverageRelationStatistics Valid=74, Invalid=259, Unknown=9, NotChecked=0, Total=342 [2024-09-13 01:04:23,293 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 12 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.8s IncrementalHoareTripleChecker+Time [2024-09-13 01:04:23,293 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 214 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 72.8s Time] [2024-09-13 01:04:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-13 01:04:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2024-09-13 01:04:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:04:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-09-13 01:04:23,317 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 38 [2024-09-13 01:04:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:04:23,317 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-09-13 01:04:23,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 12 states have internal predecessors, (34), 8 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-13 01:04:23,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:04:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-09-13 01:04:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 01:04:23,319 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:04:23,319 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-13 01:04:23,336 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-13 01:04:23,523 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:04:23,524 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:04:23,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:04:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash -701383951, now seen corresponding path program 1 times [2024-09-13 01:04:23,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:04:23,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267602560] [2024-09-13 01:04:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:04:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:04:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:23,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:04:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:23,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:04:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:23,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-13 01:04:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:23,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-13 01:04:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:23,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-13 01:04:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 01:04:23,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:04:23,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267602560] [2024-09-13 01:04:23,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267602560] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:04:23,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993860662] [2024-09-13 01:04:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:04:23,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:04:23,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:04:23,685 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-13 01:04:23,686 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-13 01:04:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:04:23,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-13 01:04:23,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:04:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 01:04:23,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:04:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-13 01:04:23,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993860662] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:04:23,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:04:23,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 13 [2024-09-13 01:04:23,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448853352] [2024-09-13 01:04:23,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:04:23,896 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-13 01:04:23,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:04:23,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-13 01:04:23,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-09-13 01:04:23,897 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 9 states have call successors, (18), 8 states have call predecessors, (18), 6 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-13 01:04:24,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:04:24,133 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-09-13 01:04:24,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-13 01:04:24,133 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 9 states have call successors, (18), 8 states have call predecessors, (18), 6 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) Word has length 39 [2024-09-13 01:04:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:04:24,134 INFO L225 Difference]: With dead ends: 79 [2024-09-13 01:04:24,134 INFO L226 Difference]: Without dead ends: 71 [2024-09-13 01:04:24,135 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2024-09-13 01:04:24,135 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:04:24,136 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 48 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:04:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-13 01:04:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-09-13 01:04:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 51 states have internal predecessors, (51), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:04:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2024-09-13 01:04:24,173 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 39 [2024-09-13 01:04:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:04:24,173 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2024-09-13 01:04:24,174 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 12 states have internal predecessors, (46), 9 states have call successors, (18), 8 states have call predecessors, (18), 6 states have return successors, (15), 7 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-13 01:04:24,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:04:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2024-09-13 01:04:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-13 01:04:24,177 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:04:24,178 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:04:24,194 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-13 01:04:24,378 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:04:24,378 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:04:24,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:04:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1815586865, now seen corresponding path program 2 times [2024-09-13 01:04:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:04:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143331055] [2024-09-13 01:04:24,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:04:24,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:04:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:04:24,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1742099694] [2024-09-13 01:04:24,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:04:24,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:04:24,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:04:24,464 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-13 01:04:24,466 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-13 01:04:24,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:04:24,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:04:24,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-13 01:04:24,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:04:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 81 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-09-13 01:04:25,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:06:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 0 refuted. 78 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-13 01:06:15,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:06:15,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143331055] [2024-09-13 01:06:15,993 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:06:15,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742099694] [2024-09-13 01:06:15,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742099694] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:06:15,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:06:15,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-09-13 01:06:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792370632] [2024-09-13 01:06:15,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:06:15,994 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-13 01:06:15,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:06:15,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-13 01:06:15,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=419, Unknown=22, NotChecked=0, Total=552 [2024-09-13 01:06:15,995 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 21 states have internal predecessors, (59), 17 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-09-13 01:06:20,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:06:54,009 WARN L293 SmtUtils]: Spent 29.17s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:06:58,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:32,882 WARN L293 SmtUtils]: Spent 26.08s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:07:36,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:41,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:45,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:49,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:53,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:07:57,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:39,448 WARN L293 SmtUtils]: Spent 22.26s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:08:43,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:47,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:51,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:55,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:08:59,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:03,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:07,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:11,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:15,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:19,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:09:23,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:08,384 WARN L293 SmtUtils]: Spent 17.81s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:10:12,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:16,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:20,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:24,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:28,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:32,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:36,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:40,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:46,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.92s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:50,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:54,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:10:58,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:02,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:06,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:10,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:14,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:11:55,511 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:11:59,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:03,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:07,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:11,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:21,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 9.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:25,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:29,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:33,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:37,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:41,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:45,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:49,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:53,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:12:57,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:01,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:05,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:09,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:13,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:17,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:21,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:13:25,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:14,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:18,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:22,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:26,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:30,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:34,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:38,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:42,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:46,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:50,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:54,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:14:58,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:02,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:06,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:10,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:14,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:19,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:23,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:27,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:31,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:35,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:39,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:43,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:47,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:51,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:15:55,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] Killed by 15