./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound20.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/hard-ll_valuebound20.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 6977cec8a403ff3f16926270da45a38f7b1f51a39c72ba3797fb74b9637fd796 --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:46:57,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 01:46:57,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 01:46:57,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 01:46:57,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 01:46:58,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 01:46:58,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 01:46:58,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 01:46:58,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 01:46:58,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 01:46:58,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 01:46:58,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 01:46:58,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 01:46:58,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 01:46:58,018 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 01:46:58,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 01:46:58,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 01:46:58,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 01:46:58,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 01:46:58,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 01:46:58,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 01:46:58,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 01:46:58,024 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 01:46:58,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 01:46:58,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 01:46:58,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 01:46:58,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 01:46:58,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 01:46:58,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 01:46:58,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 01:46:58,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 01:46:58,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 01:46:58,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:46:58,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 01:46:58,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 01:46:58,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 01:46:58,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 01:46:58,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 01:46:58,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 01:46:58,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 01:46:58,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 01:46:58,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 01:46:58,030 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 -> 6977cec8a403ff3f16926270da45a38f7b1f51a39c72ba3797fb74b9637fd796 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:46:58,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 01:46:58,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 01:46:58,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 01:46:58,295 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 01:46:58,296 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 01:46:58,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound20.c [2024-09-13 01:46:59,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 01:46:59,795 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 01:46:59,796 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound20.c [2024-09-13 01:46:59,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/38a59803a/4c819fe16d9e46c9833683e2baedafcb/FLAGb6b8033c8 [2024-09-13 01:46:59,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/38a59803a/4c819fe16d9e46c9833683e2baedafcb [2024-09-13 01:46:59,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 01:46:59,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 01:46:59,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 01:46:59,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 01:46:59,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 01:46:59,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:46:59" (1/1) ... [2024-09-13 01:46:59,836 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e80f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:46:59, skipping insertion in model container [2024-09-13 01:46:59,836 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 01:46:59" (1/1) ... [2024-09-13 01:46:59,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 01:46:59,996 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound20.c[538,551] [2024-09-13 01:47:00,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:47:00,040 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 01:47:00,053 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound20.c[538,551] [2024-09-13 01:47:00,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 01:47:00,086 INFO L204 MainTranslator]: Completed translation [2024-09-13 01:47:00,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00 WrapperNode [2024-09-13 01:47:00,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 01:47:00,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 01:47:00,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 01:47:00,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 01:47:00,095 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:47:00" (1/1) ... [2024-09-13 01:47:00,105 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:47:00" (1/1) ... [2024-09-13 01:47:00,115 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 01:47:00,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 01:47:00,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 01:47:00,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 01:47:00,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 01:47:00,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (1/1) ... [2024-09-13 01:47:00,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (1/1) ... [2024-09-13 01:47:00,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (1/1) ... [2024-09-13 01:47:00,143 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:47:00,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (1/1) ... [2024-09-13 01:47:00,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (1/1) ... [2024-09-13 01:47:00,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (1/1) ... [2024-09-13 01:47:00,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (1/1) ... [2024-09-13 01:47:00,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (1/1) ... [2024-09-13 01:47:00,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (1/1) ... [2024-09-13 01:47:00,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 01:47:00,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 01:47:00,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 01:47:00,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 01:47:00,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (1/1) ... [2024-09-13 01:47:00,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 01:47:00,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:47:00,191 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:47:00,194 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:47:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 01:47:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-13 01:47:00,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-13 01:47:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 01:47:00,232 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 01:47:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 01:47:00,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 01:47:00,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 01:47:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 01:47:00,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 01:47:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-13 01:47:00,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-13 01:47:00,298 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 01:47:00,301 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 01:47:00,463 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-13 01:47:00,463 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 01:47:00,482 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 01:47:00,482 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-13 01:47:00,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:47:00 BoogieIcfgContainer [2024-09-13 01:47:00,483 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 01:47:00,485 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 01:47:00,485 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 01:47:00,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 01:47:00,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 01:46:59" (1/3) ... [2024-09-13 01:47:00,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2d3ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:47:00, skipping insertion in model container [2024-09-13 01:47:00,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 01:47:00" (2/3) ... [2024-09-13 01:47:00,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2d3ec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 01:47:00, skipping insertion in model container [2024-09-13 01:47:00,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 01:47:00" (3/3) ... [2024-09-13 01:47:00,492 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound20.c [2024-09-13 01:47:00,515 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 01:47:00,516 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-13 01:47:00,579 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 01:47:00,601 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;@6d46deed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 01:47:00,606 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-13 01:47:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-13 01:47:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 01:47:00,620 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:00,621 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:00,622 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:00,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-13 01:47:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:00,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722809960] [2024-09-13 01:47:00,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:00,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:00,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:47:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:00,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:47:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:00,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:47:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:00,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:47:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:00,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:47:00,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:00,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722809960] [2024-09-13 01:47:00,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722809960] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:47:00,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:47:00,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-13 01:47:00,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141191560] [2024-09-13 01:47:00,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:47:00,782 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-13 01:47:00,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:00,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-13 01:47:00,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 01:47:00,799 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 01:47:00,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:00,830 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-13 01:47:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-13 01:47:00,833 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-13 01:47:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:00,839 INFO L225 Difference]: With dead ends: 66 [2024-09-13 01:47:00,839 INFO L226 Difference]: Without dead ends: 32 [2024-09-13 01:47:00,842 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-13 01:47:00,845 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:00,846 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:47:00,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-13 01:47:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-13 01:47:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:47:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-13 01:47:00,883 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-13 01:47:00,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:00,883 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-13 01:47:00,883 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-13 01:47:00,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-13 01:47:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-13 01:47:00,885 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:00,885 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:00,886 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 01:47:00,886 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:00,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-13 01:47:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:00,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534896416] [2024-09-13 01:47:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:47:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:47:01,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:47:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:47:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:47:01,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:01,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534896416] [2024-09-13 01:47:01,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534896416] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:47:01,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:47:01,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:47:01,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962244632] [2024-09-13 01:47:01,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:47:01,135 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:47:01,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:01,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:47:01,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:47:01,140 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 01:47:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:01,207 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-13 01:47:01,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:47:01,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-13 01:47:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:01,209 INFO L225 Difference]: With dead ends: 45 [2024-09-13 01:47:01,209 INFO L226 Difference]: Without dead ends: 43 [2024-09-13 01:47:01,209 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:47:01,211 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:01,211 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:47:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-13 01:47:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-13 01:47:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:47:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-13 01:47:01,223 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-13 01:47:01,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:01,225 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-13 01:47:01,225 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 01:47:01,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-13 01:47:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 01:47:01,227 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:01,227 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:01,227 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 01:47:01,228 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:01,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-13 01:47:01,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:01,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305079866] [2024-09-13 01:47:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:01,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:47:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:47:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:47:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:47:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,411 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:47:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-13 01:47:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:01,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305079866] [2024-09-13 01:47:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305079866] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:47:01,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:47:01,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:47:01,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462259038] [2024-09-13 01:47:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:47:01,420 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:47:01,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:01,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:47:01,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:47:01,421 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 01:47:01,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:01,496 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-13 01:47:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:47:01,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-13 01:47:01,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:01,498 INFO L225 Difference]: With dead ends: 49 [2024-09-13 01:47:01,499 INFO L226 Difference]: Without dead ends: 47 [2024-09-13 01:47:01,499 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:47:01,500 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:01,501 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:47:01,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-13 01:47:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-13 01:47:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 01:47:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-13 01:47:01,512 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-13 01:47:01,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:01,512 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-13 01:47:01,512 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-13 01:47:01,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-13 01:47:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-13 01:47:01,514 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:01,514 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:01,514 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 01:47:01,515 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:01,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-13 01:47:01,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475147950] [2024-09-13 01:47:01,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:47:01,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231197267] [2024-09-13 01:47:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:01,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:01,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:47:01,547 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:47:01,548 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:47:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:01,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 01:47:01,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:47:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-13 01:47:01,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 01:47:01,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:01,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475147950] [2024-09-13 01:47:01,714 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:47:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231197267] [2024-09-13 01:47:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231197267] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:47:01,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:47:01,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:47:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657659576] [2024-09-13 01:47:01,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:47:01,717 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:47:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:01,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:47:01,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:47:01,718 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 01:47:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:01,804 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-13 01:47:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:47:01,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-09-13 01:47:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:01,809 INFO L225 Difference]: With dead ends: 66 [2024-09-13 01:47:01,809 INFO L226 Difference]: Without dead ends: 53 [2024-09-13 01:47:01,809 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:47:01,810 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:01,811 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:47:01,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-13 01:47:01,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-13 01:47:01,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-13 01:47:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-13 01:47:01,836 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-13 01:47:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:01,839 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-13 01:47:01,839 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-13 01:47:01,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-13 01:47:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-13 01:47:01,840 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:01,840 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:01,858 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-13 01:47:02,041 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:02,042 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:02,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:02,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-13 01:47:02,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:02,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733825287] [2024-09-13 01:47:02,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:47:02,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103662942] [2024-09-13 01:47:02,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:02,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:02,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:47:02,063 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:47:02,065 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:47:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:02,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 01:47:02,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:47:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 01:47:02,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:47:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 01:47:02,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:02,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733825287] [2024-09-13 01:47:02,487 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:47:02,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103662942] [2024-09-13 01:47:02,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103662942] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:47:02,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:47:02,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-13 01:47:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555479077] [2024-09-13 01:47:02,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:47:02,488 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 01:47:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:02,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 01:47:02,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-13 01:47:02,489 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 01:47:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:02,617 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-09-13 01:47:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 01:47:02,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-09-13 01:47:02,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:02,621 INFO L225 Difference]: With dead ends: 68 [2024-09-13 01:47:02,621 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 01:47:02,621 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-13 01:47:02,623 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:02,624 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:47:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 01:47:02,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-09-13 01:47:02,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 01:47:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-09-13 01:47:02,649 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 44 [2024-09-13 01:47:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:02,650 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-09-13 01:47:02,650 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-13 01:47:02,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-09-13 01:47:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 01:47:02,651 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:02,651 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:02,670 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:47:02,852 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:02,852 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:02,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:02,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-13 01:47:02,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:02,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231494437] [2024-09-13 01:47:02,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:02,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:47:02,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668712578] [2024-09-13 01:47:02,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:02,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:02,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:47:02,879 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:47:02,881 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:47:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:02,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 01:47:02,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:47:03,024 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-13 01:47:03,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:47:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-13 01:47:03,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:03,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231494437] [2024-09-13 01:47:03,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:47:03,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668712578] [2024-09-13 01:47:03,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668712578] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-13 01:47:03,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 01:47:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-13 01:47:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461316188] [2024-09-13 01:47:03,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:47:03,133 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:47:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:03,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:47:03,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 01:47:03,134 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-13 01:47:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:03,242 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-09-13 01:47:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:47:03,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-09-13 01:47:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:03,244 INFO L225 Difference]: With dead ends: 73 [2024-09-13 01:47:03,244 INFO L226 Difference]: Without dead ends: 71 [2024-09-13 01:47:03,244 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-13 01:47:03,245 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:03,246 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:47:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-13 01:47:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-13 01:47:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-13 01:47:03,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-09-13 01:47:03,264 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2024-09-13 01:47:03,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:03,265 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-09-13 01:47:03,265 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-13 01:47:03,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:03,265 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-09-13 01:47:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-13 01:47:03,267 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:03,267 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:03,283 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-13 01:47:03,468 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-13 01:47:03,468 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:03,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash 515743006, now seen corresponding path program 1 times [2024-09-13 01:47:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:03,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113058887] [2024-09-13 01:47:03,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,596 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:47:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,600 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:47:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,603 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:47:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,606 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:47:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:47:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:47:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,624 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:47:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:47:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,641 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:47:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-13 01:47:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-13 01:47:03,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:03,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113058887] [2024-09-13 01:47:03,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113058887] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:47:03,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 01:47:03,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 01:47:03,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048323227] [2024-09-13 01:47:03,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:47:03,664 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:47:03,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:03,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:47:03,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:47:03,665 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 01:47:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:03,747 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-09-13 01:47:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:47:03,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2024-09-13 01:47:03,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:03,749 INFO L225 Difference]: With dead ends: 78 [2024-09-13 01:47:03,750 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 01:47:03,750 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:47:03,752 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:03,752 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:47:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 01:47:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-13 01:47:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-13 01:47:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-09-13 01:47:03,780 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2024-09-13 01:47:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:03,781 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-09-13 01:47:03,781 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-13 01:47:03,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-09-13 01:47:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-13 01:47:03,785 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:03,786 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:03,786 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-13 01:47:03,786 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:03,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-13 01:47:03,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:03,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792827883] [2024-09-13 01:47:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:03,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:47:03,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573142368] [2024-09-13 01:47:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:03,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:03,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:47:03,829 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:47:03,831 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:47:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:03,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-13 01:47:03,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:47:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-09-13 01:47:04,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:47:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-13 01:47:06,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792827883] [2024-09-13 01:47:06,182 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:47:06,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573142368] [2024-09-13 01:47:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573142368] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:47:06,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:47:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-09-13 01:47:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607711976] [2024-09-13 01:47:06,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:47:06,183 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-13 01:47:06,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:06,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-13 01:47:06,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-09-13 01:47:06,184 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2024-09-13 01:47:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:07,441 INFO L93 Difference]: Finished difference Result 153 states and 210 transitions. [2024-09-13 01:47:07,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-13 01:47:07,442 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 74 [2024-09-13 01:47:07,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:07,444 INFO L225 Difference]: With dead ends: 153 [2024-09-13 01:47:07,444 INFO L226 Difference]: Without dead ends: 130 [2024-09-13 01:47:07,445 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2024-09-13 01:47:07,445 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 79 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:07,446 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 256 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 01:47:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-09-13 01:47:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2024-09-13 01:47:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-09-13 01:47:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2024-09-13 01:47:07,506 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 74 [2024-09-13 01:47:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:07,507 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2024-09-13 01:47:07,507 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 9 states have call successors, (23), 3 states have call predecessors, (23), 2 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) [2024-09-13 01:47:07,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:07,507 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2024-09-13 01:47:07,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-13 01:47:07,512 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:07,512 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:07,529 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:47:07,715 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:07,716 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:07,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-09-13 01:47:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:07,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041071827] [2024-09-13 01:47:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:47:07,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1541221168] [2024-09-13 01:47:07,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:07,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:07,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:47:07,752 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:47:07,754 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:47:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:07,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-13 01:47:07,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:47:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-09-13 01:47:08,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:47:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-13 01:47:08,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:08,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041071827] [2024-09-13 01:47:08,938 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:47:08,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541221168] [2024-09-13 01:47:08,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541221168] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:47:08,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:47:08,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-13 01:47:08,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903525477] [2024-09-13 01:47:08,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:47:08,939 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-13 01:47:08,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:08,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-13 01:47:08,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-09-13 01:47:08,940 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-13 01:47:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:09,445 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2024-09-13 01:47:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 01:47:09,446 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) Word has length 85 [2024-09-13 01:47:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:09,449 INFO L225 Difference]: With dead ends: 145 [2024-09-13 01:47:09,449 INFO L226 Difference]: Without dead ends: 111 [2024-09-13 01:47:09,450 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2024-09-13 01:47:09,450 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 25 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:09,451 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 414 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-13 01:47:09,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-13 01:47:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-09-13 01:47:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 59 states have internal predecessors, (66), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-13 01:47:09,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-09-13 01:47:09,500 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 85 [2024-09-13 01:47:09,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:09,501 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-09-13 01:47:09,501 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-13 01:47:09,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:09,501 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-09-13 01:47:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-13 01:47:09,503 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:09,503 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:09,520 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-13 01:47:09,704 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:09,705 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:09,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1973508941, now seen corresponding path program 2 times [2024-09-13 01:47:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:09,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15340010] [2024-09-13 01:47:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:09,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,868 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:47:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:47:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:47:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:47:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:47:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:47:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:47:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:47:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:47:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,890 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:47:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:47:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:47:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-13 01:47:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-13 01:47:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:09,911 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-13 01:47:09,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:09,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15340010] [2024-09-13 01:47:09,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15340010] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:47:09,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620821229] [2024-09-13 01:47:09,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:47:09,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:09,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:47:09,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:47:09,915 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-13 01:47:09,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:47:09,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:47:09,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 01:47:09,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:47:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-13 01:47:09,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:47:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-13 01:47:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620821229] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:47:10,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:47:10,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-09-13 01:47:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706788837] [2024-09-13 01:47:10,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:47:10,086 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:47:10,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:10,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:47:10,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:47:10,086 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-09-13 01:47:10,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:10,159 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2024-09-13 01:47:10,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 01:47:10,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 87 [2024-09-13 01:47:10,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:10,161 INFO L225 Difference]: With dead ends: 124 [2024-09-13 01:47:10,161 INFO L226 Difference]: Without dead ends: 102 [2024-09-13 01:47:10,161 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-13 01:47:10,162 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:10,162 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:47:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-13 01:47:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-09-13 01:47:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-13 01:47:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-09-13 01:47:10,203 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 87 [2024-09-13 01:47:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:10,203 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-09-13 01:47:10,203 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-09-13 01:47:10,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-09-13 01:47:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-13 01:47:10,205 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:10,205 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:10,223 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-13 01:47:10,405 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-13 01:47:10,406 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:10,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -637517709, now seen corresponding path program 1 times [2024-09-13 01:47:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:10,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253701856] [2024-09-13 01:47:10,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:10,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:47:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:47:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:47:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:47:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:47:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:47:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,672 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:47:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:47:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:47:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:47:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,691 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:47:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,696 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:47:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-13 01:47:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-13 01:47:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-13 01:47:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 01:47:10,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253701856] [2024-09-13 01:47:10,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253701856] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:47:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042371156] [2024-09-13 01:47:10,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:10,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:10,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:47:10,715 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:47:10,717 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-13 01:47:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:10,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 01:47:10,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:47:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-09-13 01:47:11,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:47:11,491 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-13 01:47:11,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042371156] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:47:11,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:47:11,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 18 [2024-09-13 01:47:11,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242522383] [2024-09-13 01:47:11,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:47:11,493 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-13 01:47:11,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:11,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-13 01:47:11,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-13 01:47:11,496 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-13 01:47:11,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:11,795 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2024-09-13 01:47:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 01:47:11,795 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) Word has length 90 [2024-09-13 01:47:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:11,797 INFO L225 Difference]: With dead ends: 117 [2024-09-13 01:47:11,797 INFO L226 Difference]: Without dead ends: 100 [2024-09-13 01:47:11,797 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-09-13 01:47:11,798 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:11,798 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 384 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 01:47:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-13 01:47:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-09-13 01:47:11,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-13 01:47:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-09-13 01:47:11,829 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 90 [2024-09-13 01:47:11,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:11,830 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-09-13 01:47:11,830 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-13 01:47:11,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:11,831 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-09-13 01:47:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-13 01:47:11,831 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:11,831 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:11,847 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-13 01:47:12,035 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:12,036 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:12,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:12,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1204328542, now seen corresponding path program 1 times [2024-09-13 01:47:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:12,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752650580] [2024-09-13 01:47:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:12,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:47:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:47:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:47:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:47:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:47:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:47:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:47:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:47:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,144 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:47:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:47:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,151 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:47:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:47:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-13 01:47:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 01:47:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,162 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 01:47:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-13 01:47:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-13 01:47:12,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:47:12,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752650580] [2024-09-13 01:47:12,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752650580] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:47:12,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225964383] [2024-09-13 01:47:12,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:12,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:12,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:47:12,169 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:47:12,171 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-13 01:47:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:47:12,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-13 01:47:12,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:47:12,277 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-13 01:47:12,277 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 01:47:12,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225964383] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 01:47:12,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-13 01:47:12,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-09-13 01:47:12,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368590041] [2024-09-13 01:47:12,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 01:47:12,278 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 01:47:12,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:47:12,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 01:47:12,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:47:12,280 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-13 01:47:12,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:47:12,370 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-09-13 01:47:12,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:47:12,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 94 [2024-09-13 01:47:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:47:12,372 INFO L225 Difference]: With dead ends: 100 [2024-09-13 01:47:12,372 INFO L226 Difference]: Without dead ends: 88 [2024-09-13 01:47:12,372 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-13 01:47:12,373 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 01:47:12,373 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 01:47:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-13 01:47:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-13 01:47:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-13 01:47:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2024-09-13 01:47:12,419 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 94 [2024-09-13 01:47:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:47:12,420 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2024-09-13 01:47:12,420 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-13 01:47:12,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2024-09-13 01:47:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-09-13 01:47:12,422 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:47:12,422 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:47:12,438 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-13 01:47:12,622 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:12,622 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:47:12,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:47:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash -588826413, now seen corresponding path program 3 times [2024-09-13 01:47:12,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:47:12,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937137384] [2024-09-13 01:47:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:47:12,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:47:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:47:12,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [145852258] [2024-09-13 01:47:12,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 01:47:12,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:47:12,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:47:12,661 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:47:12,662 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-13 01:47:13,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-13 01:47:13,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:47:13,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-13 01:47:13,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:47:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 69 proven. 47 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-09-13 01:47:13,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:47:26,901 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-13 01:48:47,819 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 74 proven. 42 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2024-09-13 01:48:47,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:48:47,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937137384] [2024-09-13 01:48:47,819 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:48:47,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145852258] [2024-09-13 01:48:47,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145852258] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:48:47,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:48:47,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2024-09-13 01:48:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723901485] [2024-09-13 01:48:47,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:48:47,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 01:48:47,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:48:47,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 01:48:47,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-09-13 01:48:47,821 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 19 states have internal predecessors, (47), 11 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 9 states have call successors, (30) [2024-09-13 01:48:56,413 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:49:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:49:15,940 INFO L93 Difference]: Finished difference Result 181 states and 242 transitions. [2024-09-13 01:49:15,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-13 01:49:15,941 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 19 states have internal predecessors, (47), 11 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 9 states have call successors, (30) Word has length 104 [2024-09-13 01:49:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:49:15,942 INFO L225 Difference]: With dead ends: 181 [2024-09-13 01:49:15,942 INFO L226 Difference]: Without dead ends: 159 [2024-09-13 01:49:15,943 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2024-09-13 01:49:15,943 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 47 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 118 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-09-13 01:49:15,944 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 324 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 465 Invalid, 1 Unknown, 0 Unchecked, 7.4s Time] [2024-09-13 01:49:15,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-09-13 01:49:16,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 140. [2024-09-13 01:49:16,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 82 states have (on average 1.1585365853658536) internal successors, (95), 87 states have internal predecessors, (95), 43 states have call successors, (43), 15 states have call predecessors, (43), 14 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2024-09-13 01:49:16,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 179 transitions. [2024-09-13 01:49:16,010 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 179 transitions. Word has length 104 [2024-09-13 01:49:16,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:49:16,011 INFO L474 AbstractCegarLoop]: Abstraction has 140 states and 179 transitions. [2024-09-13 01:49:16,011 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 19 states have internal predecessors, (47), 11 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (30), 10 states have call predecessors, (30), 9 states have call successors, (30) [2024-09-13 01:49:16,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:49:16,011 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2024-09-13 01:49:16,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-13 01:49:16,012 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:49:16,012 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:49:16,020 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-13 01:49:16,212 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-13 01:49:16,213 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:49:16,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:49:16,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1973122394, now seen corresponding path program 2 times [2024-09-13 01:49:16,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:49:16,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877411264] [2024-09-13 01:49:16,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:49:16,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:49:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:49:16,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172409939] [2024-09-13 01:49:16,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:49:16,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:49:16,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:49:16,266 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:49:16,268 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-13 01:49:16,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:49:16,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:49:16,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-13 01:49:16,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:49:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 124 proven. 22 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2024-09-13 01:49:16,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:49:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-13 01:49:16,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:49:16,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877411264] [2024-09-13 01:49:16,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:49:16,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172409939] [2024-09-13 01:49:16,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172409939] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:49:16,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:49:16,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2024-09-13 01:49:16,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655032289] [2024-09-13 01:49:16,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:49:16,641 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-13 01:49:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:49:16,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-13 01:49:16,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-09-13 01:49:16,641 INFO L87 Difference]: Start difference. First operand 140 states and 179 transitions. Second operand has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-13 01:49:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:49:17,237 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2024-09-13 01:49:17,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 01:49:17,237 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 115 [2024-09-13 01:49:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:49:17,239 INFO L225 Difference]: With dead ends: 156 [2024-09-13 01:49:17,239 INFO L226 Difference]: Without dead ends: 154 [2024-09-13 01:49:17,239 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-09-13 01:49:17,240 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 01:49:17,240 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 233 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 01:49:17,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-09-13 01:49:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-09-13 01:49:17,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 92 states have (on average 1.141304347826087) internal successors, (105), 98 states have internal predecessors, (105), 44 states have call successors, (44), 18 states have call predecessors, (44), 17 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-09-13 01:49:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 191 transitions. [2024-09-13 01:49:17,330 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 191 transitions. Word has length 115 [2024-09-13 01:49:17,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:49:17,331 INFO L474 AbstractCegarLoop]: Abstraction has 154 states and 191 transitions. [2024-09-13 01:49:17,331 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 5 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2024-09-13 01:49:17,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:49:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 191 transitions. [2024-09-13 01:49:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-09-13 01:49:17,332 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:49:17,333 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:49:17,350 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-13 01:49:17,536 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-13 01:49:17,537 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:49:17,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:49:17,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1536141598, now seen corresponding path program 4 times [2024-09-13 01:49:17,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:49:17,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44353462] [2024-09-13 01:49:17,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:49:17,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:49:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:49:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:49:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:49:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:49:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,795 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:49:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:49:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:49:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:49:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:49:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:49:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:49:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:49:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,826 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-13 01:49:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,829 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 01:49:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 01:49:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-13 01:49:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-13 01:49:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-13 01:49:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-13 01:49:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-09-13 01:49:17,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:49:17,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44353462] [2024-09-13 01:49:17,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44353462] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:49:17,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361461714] [2024-09-13 01:49:17,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 01:49:17,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:49:17,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:49:17,852 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:49:17,854 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-13 01:49:17,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 01:49:17,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:49:17,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 01:49:17,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:49:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-09-13 01:49:17,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:49:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-09-13 01:49:18,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361461714] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:49:18,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:49:18,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-09-13 01:49:18,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744064758] [2024-09-13 01:49:18,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:49:18,182 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 01:49:18,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:49:18,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 01:49:18,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 01:49:18,183 INFO L87 Difference]: Start difference. First operand 154 states and 191 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-09-13 01:49:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:49:18,313 INFO L93 Difference]: Finished difference Result 184 states and 225 transitions. [2024-09-13 01:49:18,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 01:49:18,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) Word has length 117 [2024-09-13 01:49:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:49:18,316 INFO L225 Difference]: With dead ends: 184 [2024-09-13 01:49:18,316 INFO L226 Difference]: Without dead ends: 144 [2024-09-13 01:49:18,316 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-13 01:49:18,317 INFO L434 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 01:49:18,317 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 188 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 01:49:18,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-09-13 01:49:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-09-13 01:49:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 90 states have internal predecessors, (94), 39 states have call successors, (39), 18 states have call predecessors, (39), 17 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2024-09-13 01:49:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2024-09-13 01:49:18,387 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 117 [2024-09-13 01:49:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:49:18,387 INFO L474 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2024-09-13 01:49:18,387 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 7 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (29), 6 states have call predecessors, (29), 6 states have call successors, (29) [2024-09-13 01:49:18,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:49:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2024-09-13 01:49:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-09-13 01:49:18,389 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:49:18,389 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:49:18,404 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-13 01:49:18,589 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-13 01:49:18,589 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:49:18,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:49:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash 47128766, now seen corresponding path program 2 times [2024-09-13 01:49:18,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:49:18,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096795296] [2024-09-13 01:49:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:49:18,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:49:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:18,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 01:49:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:18,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-13 01:49:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:18,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-13 01:49:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:18,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-13 01:49:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:18,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 01:49:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:18,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-13 01:49:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-13 01:49:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-13 01:49:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-13 01:49:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-13 01:49:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-13 01:49:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-13 01:49:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-13 01:49:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-13 01:49:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-13 01:49:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,032 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-13 01:49:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-13 01:49:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,042 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-13 01:49:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-13 01:49:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,048 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-13 01:49:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 01:49:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-13 01:49:19,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:49:19,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096795296] [2024-09-13 01:49:19,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096795296] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 01:49:19,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025952297] [2024-09-13 01:49:19,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 01:49:19,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:49:19,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:49:19,053 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:49:19,054 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-13 01:49:19,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 01:49:19,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:49:19,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-13 01:49:19,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:49:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-13 01:49:19,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:49:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-13 01:49:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025952297] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:49:20,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 01:49:20,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 14] total 30 [2024-09-13 01:49:20,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195917529] [2024-09-13 01:49:20,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 01:49:20,658 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-13 01:49:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:49:20,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-13 01:49:20,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2024-09-13 01:49:20,660 INFO L87 Difference]: Start difference. First operand 142 states and 170 transitions. Second operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) [2024-09-13 01:49:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 01:49:21,413 INFO L93 Difference]: Finished difference Result 158 states and 191 transitions. [2024-09-13 01:49:21,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-13 01:49:21,414 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) Word has length 120 [2024-09-13 01:49:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 01:49:21,415 INFO L225 Difference]: With dead ends: 158 [2024-09-13 01:49:21,415 INFO L226 Difference]: Without dead ends: 130 [2024-09-13 01:49:21,416 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=214, Invalid=1192, Unknown=0, NotChecked=0, Total=1406 [2024-09-13 01:49:21,416 INFO L434 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 01:49:21,416 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 657 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 01:49:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-09-13 01:49:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2024-09-13 01:49:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 80 states have internal predecessors, (83), 32 states have call successors, (32), 18 states have call predecessors, (32), 17 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-13 01:49:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2024-09-13 01:49:21,464 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 120 [2024-09-13 01:49:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 01:49:21,465 INFO L474 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2024-09-13 01:49:21,465 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 27 states have internal predecessors, (62), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 19 states have call predecessors, (49), 19 states have call successors, (49) [2024-09-13 01:49:21,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:49:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2024-09-13 01:49:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-09-13 01:49:21,467 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 01:49:21,467 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 01:49:21,487 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-13 01:49:21,670 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-13 01:49:21,670 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 01:49:21,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 01:49:21,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1414642200, now seen corresponding path program 5 times [2024-09-13 01:49:21,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 01:49:21,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228419021] [2024-09-13 01:49:21,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 01:49:21,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 01:49:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-13 01:49:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [888857651] [2024-09-13 01:49:21,722 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-13 01:49:21,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 01:49:21,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 01:49:21,726 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 01:49:21,729 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-13 01:49:21,833 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-09-13 01:49:21,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 01:49:21,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-09-13 01:49:21,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 01:49:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 82 proven. 101 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-09-13 01:49:22,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 01:51:01,935 WARN L293 SmtUtils]: Spent 7.38s on a formula simplification that was a NOOP. DAG size: 255 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:51:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 82 proven. 101 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2024-09-13 01:51:48,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 01:51:48,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228419021] [2024-09-13 01:51:48,218 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-13 01:51:48,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888857651] [2024-09-13 01:51:48,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888857651] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 01:51:48,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 01:51:48,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2024-09-13 01:51:48,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052158909] [2024-09-13 01:51:48,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 01:51:48,219 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-13 01:51:48,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 01:51:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-13 01:51:48,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=804, Unknown=1, NotChecked=0, Total=992 [2024-09-13 01:51:48,220 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 32 states, 32 states have (on average 1.78125) internal successors, (57), 29 states have internal predecessors, (57), 19 states have call successors, (43), 3 states have call predecessors, (43), 2 states have return successors, (40), 15 states have call predecessors, (40), 17 states have call successors, (40) [2024-09-13 01:51:56,627 WARN L293 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 447 DAG size of output: 38 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:51:58,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:02,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:04,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:09,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:11,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:14,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:16,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:17,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:19,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:37,295 WARN L293 SmtUtils]: Spent 10.31s on a formula simplification. DAG size of input: 423 DAG size of output: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:52:49,560 WARN L293 SmtUtils]: Spent 6.40s on a formula simplification. DAG size of input: 409 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:52:51,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:52:55,288 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:53:15,083 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification. DAG size of input: 360 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:53:43,371 WARN L293 SmtUtils]: Spent 8.79s on a formula simplification. DAG size of input: 403 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:53:46,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:53:50,304 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:53:54,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:53:56,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:54:51,896 WARN L293 SmtUtils]: Spent 41.87s on a formula simplification. DAG size of input: 331 DAG size of output: 120 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:54:54,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:54:55,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:54:58,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:54:59,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:55:49,830 WARN L293 SmtUtils]: Spent 35.39s on a formula simplification. DAG size of input: 339 DAG size of output: 119 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:55:53,855 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:55:58,066 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:56:02,072 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:56:05,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:56:07,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:57:09,867 WARN L293 SmtUtils]: Spent 38.98s on a formula simplification. DAG size of input: 353 DAG size of output: 142 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:57:16,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:57:40,512 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification. DAG size of input: 449 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:57:43,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:57:46,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:57:50,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:57:52,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:57:56,637 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:58:00,641 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:58:06,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:11,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:13,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:16,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:17,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 01:58:40,760 WARN L293 SmtUtils]: Spent 11.19s on a formula simplification. DAG size of input: 76 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:59:00,918 WARN L293 SmtUtils]: Spent 12.53s on a formula simplification. DAG size of input: 323 DAG size of output: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:59:23,698 WARN L293 SmtUtils]: Spent 11.31s on a formula simplification. DAG size of input: 322 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:59:40,844 WARN L293 SmtUtils]: Spent 8.96s on a formula simplification. DAG size of input: 219 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 01:59:42,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-13 02:00:28,630 WARN L293 SmtUtils]: Spent 9.13s on a formula simplification. DAG size of input: 299 DAG size of output: 72 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-13 02:00:32,656 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 02:01:14,616 WARN L293 SmtUtils]: Spent 15.68s on a formula simplification that was a NOOP. DAG size: 314 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15