./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.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 45ff7b74faf4250f77b788e07275d725ea3dbcc73af0b2b0d64dcf5aa7f7b78a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:09:58,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:09:58,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:09:58,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:09:58,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:09:58,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:09:58,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:09:58,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:09:58,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:09:58,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:09:58,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:09:58,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:09:58,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:09:58,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:09:58,269 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:09:58,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:09:58,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:09:58,269 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:09:58,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:09:58,270 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:09:58,270 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:09:58,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:09:58,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:09:58,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:09:58,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:09:58,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:09:58,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:09:58,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:09:58,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:09:58,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:09:58,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:09:58,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:09:58,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:09:58,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:09:58,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:09:58,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:09:58,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:09:58,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:09:58,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:09:58,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:09:58,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:09:58,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:09:58,277 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 -> 45ff7b74faf4250f77b788e07275d725ea3dbcc73af0b2b0d64dcf5aa7f7b78a 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 11:09:58,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:09:58,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:09:58,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:09:58,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:09:58,590 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:09:58,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c [2024-09-25 11:10:00,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:10:00,287 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:10:00,288 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c [2024-09-25 11:10:00,297 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/84fdc8bf2/52114ff694df41779fda9e36d45f1a5f/FLAG72ea2e51c [2024-09-25 11:10:00,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/84fdc8bf2/52114ff694df41779fda9e36d45f1a5f [2024-09-25 11:10:00,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:10:00,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:10:00,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:10:00,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:10:00,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:10:00,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b35b78d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00, skipping insertion in model container [2024-09-25 11:10:00,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:10:00,518 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c[526,539] [2024-09-25 11:10:00,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:10:00,553 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:10:00,566 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c[526,539] [2024-09-25 11:10:00,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:10:00,609 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:10:00,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00 WrapperNode [2024-09-25 11:10:00,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:10:00,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:10:00,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:10:00,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:10:00,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,632 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:10:00,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:10:00,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:10:00,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:10:00,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:10:00,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,667 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-25 11:10:00,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,676 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:10:00,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:10:00,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:10:00,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:10:00,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (1/1) ... [2024-09-25 11:10:00,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:10:00,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:10:00,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 11:10:00,722 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 11:10:00,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:10:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:10:00,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:10:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:10:00,762 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:10:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:10:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 11:10:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:10:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:10:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:10:00,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:10:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:10:00,765 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:10:00,824 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:10:00,826 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:10:00,974 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 11:10:00,975 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:10:01,008 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:10:01,011 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 11:10:01,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:10:01 BoogieIcfgContainer [2024-09-25 11:10:01,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:10:01,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:10:01,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:10:01,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:10:01,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:10:00" (1/3) ... [2024-09-25 11:10:01,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc15114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:10:01, skipping insertion in model container [2024-09-25 11:10:01,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:10:00" (2/3) ... [2024-09-25 11:10:01,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc15114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:10:01, skipping insertion in model container [2024-09-25 11:10:01,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:10:01" (3/3) ... [2024-09-25 11:10:01,020 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound1.c [2024-09-25 11:10:01,035 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:10:01,035 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:10:01,093 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:10:01,101 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;@7c7b8ac8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:10:01,101 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:10:01,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:10:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 11:10:01,112 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:01,113 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:10:01,113 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:01,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:01,120 INFO L85 PathProgramCache]: Analyzing trace with hash -909137831, now seen corresponding path program 1 times [2024-09-25 11:10:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:01,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345041848] [2024-09-25 11:10:01,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:01,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:01,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:10:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:01,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:10:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:10:01,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:01,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345041848] [2024-09-25 11:10:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345041848] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:10:01,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:10:01,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 11:10:01,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883509078] [2024-09-25 11:10:01,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:10:01,331 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 11:10:01,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:01,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 11:10:01,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:10:01,351 INFO L87 Difference]: Start difference. First operand has 33 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 11:10:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:01,375 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2024-09-25 11:10:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 11:10:01,380 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 11:10:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:01,386 INFO L225 Difference]: With dead ends: 58 [2024-09-25 11:10:01,386 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 11:10:01,389 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:10:01,392 INFO L434 NwaCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:10:01,393 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:10:01,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 11:10:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-25 11:10:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 11:10:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-09-25 11:10:01,431 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-09-25 11:10:01,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:01,433 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-09-25 11:10:01,433 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 11:10:01,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-09-25 11:10:01,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 11:10:01,435 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:01,436 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:10:01,436 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:10:01,436 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:01,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:01,438 INFO L85 PathProgramCache]: Analyzing trace with hash -229079461, now seen corresponding path program 1 times [2024-09-25 11:10:01,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:01,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938844062] [2024-09-25 11:10:01,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:01,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:01,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:10:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:01,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:10:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:10:01,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:01,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938844062] [2024-09-25 11:10:01,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938844062] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:10:01,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:10:01,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:10:01,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932353350] [2024-09-25 11:10:01,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:10:01,629 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:10:01,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:01,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:10:01,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:10:01,631 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 11:10:01,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:01,711 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-09-25 11:10:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:10:01,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 11:10:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:01,715 INFO L225 Difference]: With dead ends: 42 [2024-09-25 11:10:01,715 INFO L226 Difference]: Without dead ends: 40 [2024-09-25 11:10:01,715 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-25 11:10:01,717 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 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-25 11:10:01,718 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:10:01,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-25 11:10:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2024-09-25 11:10:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 11:10:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-09-25 11:10:01,731 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 16 [2024-09-25 11:10:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:01,732 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-09-25 11:10:01,732 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 11:10:01,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:01,733 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-09-25 11:10:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 11:10:01,733 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:01,733 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:10:01,734 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:10:01,734 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:01,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash 520476838, now seen corresponding path program 1 times [2024-09-25 11:10:01,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:01,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673038910] [2024-09-25 11:10:01,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:01,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:01,872 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:10:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:01,877 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:10:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:01,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 11:10:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:10:01,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:01,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673038910] [2024-09-25 11:10:01,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673038910] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:10:01,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:10:01,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:10:01,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032955037] [2024-09-25 11:10:01,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:10:01,887 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:10:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:01,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:10:01,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:10:01,889 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 11:10:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:01,956 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2024-09-25 11:10:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:10:01,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-25 11:10:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:01,958 INFO L225 Difference]: With dead ends: 46 [2024-09-25 11:10:01,958 INFO L226 Difference]: Without dead ends: 44 [2024-09-25 11:10:01,959 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:10:01,960 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 111 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.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:10:01,960 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 111 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:10:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-25 11:10:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2024-09-25 11:10:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-25 11:10:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-09-25 11:10:01,968 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2024-09-25 11:10:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:01,969 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-09-25 11:10:01,969 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 11:10:01,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:01,969 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-09-25 11:10:01,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-25 11:10:01,970 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:01,970 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:10:01,970 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 11:10:01,971 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:01,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:01,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1140086011, now seen corresponding path program 1 times [2024-09-25 11:10:01,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:01,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191539267] [2024-09-25 11:10:01,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:01,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:10:01,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058452505] [2024-09-25 11:10:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:01,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:10:01,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:10:01,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:10:01,997 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 11:10:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:02,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 11:10:02,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:10:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:10:02,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:10:02,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191539267] [2024-09-25 11:10:02,163 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:10:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058452505] [2024-09-25 11:10:02,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058452505] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:10:02,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:10:02,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:10:02,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317640615] [2024-09-25 11:10:02,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:10:02,168 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:10:02,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:02,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:10:02,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:10:02,170 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:10:02,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:02,251 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-09-25 11:10:02,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:10:02,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-09-25 11:10:02,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:02,253 INFO L225 Difference]: With dead ends: 63 [2024-09-25 11:10:02,253 INFO L226 Difference]: Without dead ends: 50 [2024-09-25 11:10:02,254 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-25 11:10:02,255 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:10:02,255 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:10:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-25 11:10:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-09-25 11:10:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 11:10:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-09-25 11:10:02,278 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 26 [2024-09-25 11:10:02,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:02,279 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-09-25 11:10:02,279 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:10:02,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-09-25 11:10:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-25 11:10:02,281 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:02,281 INFO L216 NwaCegarLoop]: trace histogram [4, 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] [2024-09-25 11:10:02,298 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:10:02,483 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-25 11:10:02,484 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:02,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash -975701997, now seen corresponding path program 1 times [2024-09-25 11:10:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:02,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255719905] [2024-09-25 11:10:02,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:10:02,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581029478] [2024-09-25 11:10:02,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:02,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:10:02,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:10:02,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:10:02,507 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 11:10:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:02,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 11:10:02,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:10:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:10:02,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:10:02,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255719905] [2024-09-25 11:10:02,618 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:10:02,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581029478] [2024-09-25 11:10:02,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581029478] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:10:02,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:10:02,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:10:02,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438022897] [2024-09-25 11:10:02,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:10:02,619 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:10:02,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:10:02,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:10:02,620 INFO L87 Difference]: Start difference. First operand 50 states and 61 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:10:02,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:02,682 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-09-25 11:10:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:10:02,683 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, (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 33 [2024-09-25 11:10:02,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:02,684 INFO L225 Difference]: With dead ends: 63 [2024-09-25 11:10:02,684 INFO L226 Difference]: Without dead ends: 61 [2024-09-25 11:10:02,684 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-25 11:10:02,685 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:10:02,686 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 95 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:10:02,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-25 11:10:02,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-09-25 11:10:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 18 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-25 11:10:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2024-09-25 11:10:02,698 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 33 [2024-09-25 11:10:02,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:02,699 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2024-09-25 11:10:02,699 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:10:02,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2024-09-25 11:10:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 11:10:02,704 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:02,704 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:10:02,721 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 11:10:02,905 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-25 11:10:02,905 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:02,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:02,906 INFO L85 PathProgramCache]: Analyzing trace with hash -928833564, now seen corresponding path program 1 times [2024-09-25 11:10:02,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:02,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653248417] [2024-09-25 11:10:02,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:02,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:10:02,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641371757] [2024-09-25 11:10:02,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:02,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:10:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:10:02,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:10:02,935 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 11:10:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:02,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 11:10:02,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:10:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 11:10:03,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:10:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-25 11:10:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653248417] [2024-09-25 11:10:03,232 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:10:03,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641371757] [2024-09-25 11:10:03,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641371757] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 11:10:03,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:10:03,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-25 11:10:03,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404715726] [2024-09-25 11:10:03,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:10:03,235 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:10:03,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:03,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:10:03,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:10:03,236 INFO L87 Difference]: Start difference. First operand 60 states and 75 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-25 11:10:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:03,312 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2024-09-25 11:10:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:10:03,313 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 43 [2024-09-25 11:10:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:03,315 INFO L225 Difference]: With dead ends: 70 [2024-09-25 11:10:03,316 INFO L226 Difference]: Without dead ends: 68 [2024-09-25 11:10:03,316 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:10:03,319 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:10:03,319 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:10:03,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-25 11:10:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-09-25 11:10:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 41 states have internal predecessors, (45), 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-25 11:10:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2024-09-25 11:10:03,348 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 83 transitions. Word has length 43 [2024-09-25 11:10:03,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:03,348 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 83 transitions. [2024-09-25 11:10:03,349 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-25 11:10:03,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2024-09-25 11:10:03,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 11:10:03,350 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:03,353 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 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-25 11:10:03,369 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 11:10:03,556 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-25 11:10:03,557 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:03,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -238148106, now seen corresponding path program 1 times [2024-09-25 11:10:03,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:03,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24484878] [2024-09-25 11:10:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:03,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:03,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:10:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:03,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:10:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:03,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 11:10:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:03,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:10:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:03,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 11:10:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:03,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:10:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:03,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-25 11:10:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:03,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:10:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-25 11:10:03,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24484878] [2024-09-25 11:10:03,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24484878] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:10:03,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:10:03,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:10:03,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910152354] [2024-09-25 11:10:03,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:10:03,696 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:10:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:03,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:10:03,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:10:03,697 INFO L87 Difference]: Start difference. First operand 67 states and 83 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 11:10:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:03,751 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2024-09-25 11:10:03,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:10:03,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2024-09-25 11:10:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:03,755 INFO L225 Difference]: With dead ends: 75 [2024-09-25 11:10:03,755 INFO L226 Difference]: Without dead ends: 63 [2024-09-25 11:10:03,755 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:10:03,756 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:10:03,758 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 123 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:10:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-25 11:10:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-25 11:10:03,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 39 states have internal predecessors, (42), 18 states have call successors, (18), 9 states have call predecessors, (18), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-25 11:10:03,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2024-09-25 11:10:03,778 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 49 [2024-09-25 11:10:03,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:03,778 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2024-09-25 11:10:03,778 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 11:10:03,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2024-09-25 11:10:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-25 11:10:03,780 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:03,780 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 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] [2024-09-25 11:10:03,780 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 11:10:03,784 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:03,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1374799408, now seen corresponding path program 1 times [2024-09-25 11:10:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:03,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785149733] [2024-09-25 11:10:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:10:03,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [840576858] [2024-09-25 11:10:03,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:03,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:10:03,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:10:03,841 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:10:03,843 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 11:10:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:03,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-25 11:10:03,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:10:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-25 11:10:04,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:10:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-25 11:10:05,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:05,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785149733] [2024-09-25 11:10:05,569 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:10:05,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840576858] [2024-09-25 11:10:05,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840576858] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:10:05,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:10:05,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-09-25 11:10:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668752265] [2024-09-25 11:10:05,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:10:05,571 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 11:10:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:05,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 11:10:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:10:05,572 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-25 11:10:06,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:06,159 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2024-09-25 11:10:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 11:10:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 63 [2024-09-25 11:10:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:06,161 INFO L225 Difference]: With dead ends: 138 [2024-09-25 11:10:06,161 INFO L226 Difference]: Without dead ends: 115 [2024-09-25 11:10:06,162 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-09-25 11:10:06,162 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 33 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:10:06,163 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 225 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:10:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-09-25 11:10:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2024-09-25 11:10:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 71 states have internal predecessors, (80), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-09-25 11:10:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2024-09-25 11:10:06,219 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 63 [2024-09-25 11:10:06,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:06,221 INFO L474 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2024-09-25 11:10:06,221 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 8 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2024-09-25 11:10:06,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2024-09-25 11:10:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-25 11:10:06,225 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:06,225 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 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] [2024-09-25 11:10:06,242 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 11:10:06,429 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-25 11:10:06,430 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:06,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:06,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2048390162, now seen corresponding path program 1 times [2024-09-25 11:10:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:06,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411323866] [2024-09-25 11:10:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:06,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:10:06,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133598216] [2024-09-25 11:10:06,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:06,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:10:06,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:10:06,461 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:10:06,462 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 11:10:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:06,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 11:10:06,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:10:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-25 11:10:06,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:10:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 19 proven. 37 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-25 11:10:07,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:07,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411323866] [2024-09-25 11:10:07,295 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:10:07,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133598216] [2024-09-25 11:10:07,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133598216] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:10:07,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:10:07,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-09-25 11:10:07,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184549880] [2024-09-25 11:10:07,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:10:07,297 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 11:10:07,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:07,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 11:10:07,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-09-25 11:10:07,298 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-09-25 11:10:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:07,953 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2024-09-25 11:10:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 11:10:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 74 [2024-09-25 11:10:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:07,956 INFO L225 Difference]: With dead ends: 168 [2024-09-25 11:10:07,956 INFO L226 Difference]: Without dead ends: 136 [2024-09-25 11:10:07,957 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-09-25 11:10:07,957 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 11:10:07,958 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 195 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 11:10:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-09-25 11:10:08,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2024-09-25 11:10:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 70 states have internal predecessors, (76), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-09-25 11:10:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-09-25 11:10:08,005 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 74 [2024-09-25 11:10:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:08,006 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-09-25 11:10:08,006 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 15 states have internal predecessors, (38), 9 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2024-09-25 11:10:08,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-09-25 11:10:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-09-25 11:10:08,008 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:08,008 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 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-25 11:10:08,026 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 11:10:08,212 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-25 11:10:08,213 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:08,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1556827571, now seen corresponding path program 1 times [2024-09-25 11:10:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057584475] [2024-09-25 11:10:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,495 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:10:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:10:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,502 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 11:10:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:10:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 11:10:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:10:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-25 11:10:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-25 11:10:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-25 11:10:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 11:10:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-25 11:10:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,547 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-25 11:10:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,550 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-25 11:10:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 11:10:08,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:08,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057584475] [2024-09-25 11:10:08,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057584475] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:10:08,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067348399] [2024-09-25 11:10:08,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:08,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:10:08,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:10:08,557 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:10:08,560 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 11:10:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:08,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 11:10:08,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:10:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 11:10:08,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:10:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-25 11:10:09,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067348399] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:10:09,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:10:09,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-25 11:10:09,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549828026] [2024-09-25 11:10:09,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:10:09,148 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 11:10:09,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:09,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 11:10:09,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-25 11:10:09,151 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2024-09-25 11:10:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:09,314 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2024-09-25 11:10:09,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 11:10:09,315 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) Word has length 79 [2024-09-25 11:10:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:09,316 INFO L225 Difference]: With dead ends: 129 [2024-09-25 11:10:09,316 INFO L226 Difference]: Without dead ends: 100 [2024-09-25 11:10:09,316 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 177 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:10:09,317 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:10:09,317 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 225 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:10:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-25 11:10:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-09-25 11:10:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 63 states have internal predecessors, (67), 26 states have call successors, (26), 14 states have call predecessors, (26), 13 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-25 11:10:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2024-09-25 11:10:09,344 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 79 [2024-09-25 11:10:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:09,345 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2024-09-25 11:10:09,345 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 11 states have internal predecessors, (43), 8 states have call successors, (38), 3 states have call predecessors, (38), 1 states have return successors, (34), 8 states have call predecessors, (34), 8 states have call successors, (34) [2024-09-25 11:10:09,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2024-09-25 11:10:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-09-25 11:10:09,348 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:10:09,348 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 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] [2024-09-25 11:10:09,364 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 11:10:09,548 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-25 11:10:09,549 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:10:09,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash -802122381, now seen corresponding path program 2 times [2024-09-25 11:10:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:10:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119336200] [2024-09-25 11:10:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:10:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:10:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:10:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:10:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-25 11:10:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 11:10:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,762 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 11:10:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,766 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-25 11:10:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-25 11:10:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-25 11:10:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,781 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-25 11:10:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 11:10:09,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-25 11:10:09,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-25 11:10:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-25 11:10:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-25 11:10:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-25 11:10:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:10:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2024-09-25 11:10:09,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:10:09,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119336200] [2024-09-25 11:10:09,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119336200] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:10:09,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738492790] [2024-09-25 11:10:09,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:10:09,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:10:09,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:10:09,798 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:10:09,799 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 11:10:09,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:10:09,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:10:09,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 11:10:09,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:10:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-09-25 11:10:09,930 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:10:09,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738492790] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:10:09,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:10:09,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-09-25 11:10:09,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075254892] [2024-09-25 11:10:09,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:10:09,931 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 11:10:09,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:10:09,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 11:10:09,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-25 11:10:09,935 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-25 11:10:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:10:09,982 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-09-25 11:10:09,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 11:10:09,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 93 [2024-09-25 11:10:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:10:09,983 INFO L225 Difference]: With dead ends: 100 [2024-09-25 11:10:09,983 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:10:09,984 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:10:09,984 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:10:09,984 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 113 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:10:09,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:10:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:10:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 11:10:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:10:09,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2024-09-25 11:10:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:10:09,985 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:10:09,986 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-25 11:10:09,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:10:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:10:09,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:10:09,988 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:10:10,002 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 11:10:10,189 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-25 11:10:10,192 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:10:10,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:10:10,764 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:10:10,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:10:10,778 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:10:10,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:10:10,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:10:10,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:10:10,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:10:10,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:10:10,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:10:10,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:10:10,779 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:10:10,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:10:10,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:10:10,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:10:10,780 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:10:10,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:10:10,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:10:10,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:10:10,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:10:10,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:10:10,781 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:10:10,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:10:10,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:10:10,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:10:10,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:10:10,782 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:10:10,783 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:10:10,783 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:10:10,783 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:10:10,783 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:10:10,783 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:10:10,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:10:10 BoogieIcfgContainer [2024-09-25 11:10:10,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:10:10,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:10:10,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:10:10,784 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:10:10,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:10:01" (3/4) ... [2024-09-25 11:10:10,786 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:10:10,834 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:10:10,835 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:10:10,835 INFO L158 Benchmark]: Toolchain (without parser) took 10516.34ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 54.9MB in the beginning and 107.4MB in the end (delta: -52.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-09-25 11:10:10,835 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 28.1MB in the beginning and 28.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:10:10,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.15ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 64.7MB in the end (delta: -10.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2024-09-25 11:10:10,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.54ms. Allocated memory is still 83.9MB. Free memory was 64.3MB in the beginning and 63.6MB in the end (delta: 681.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:10:10,836 INFO L158 Benchmark]: Boogie Preprocessor took 46.52ms. Allocated memory is still 83.9MB. Free memory was 63.3MB in the beginning and 61.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:10:10,837 INFO L158 Benchmark]: RCFGBuilder took 331.33ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 48.3MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 11:10:10,839 INFO L158 Benchmark]: TraceAbstraction took 9769.66ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 47.7MB in the beginning and 110.6MB in the end (delta: -62.9MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. [2024-09-25 11:10:10,839 INFO L158 Benchmark]: Witness Printer took 50.55ms. Allocated memory is still 176.2MB. Free memory was 110.6MB in the beginning and 107.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-25 11:10:10,840 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 28.1MB in the beginning and 28.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.15ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 64.7MB in the end (delta: -10.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.54ms. Allocated memory is still 83.9MB. Free memory was 64.3MB in the beginning and 63.6MB in the end (delta: 681.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.52ms. Allocated memory is still 83.9MB. Free memory was 63.3MB in the beginning and 61.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.33ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 48.3MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9769.66ms. Allocated memory was 83.9MB in the beginning and 176.2MB in the end (delta: 92.3MB). Free memory was 47.7MB in the beginning and 110.6MB in the end (delta: -62.9MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. * Witness Printer took 50.55ms. Allocated memory is still 176.2MB. Free memory was 110.6MB in the beginning and 107.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 11, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 126 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 1459 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1103 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 898 IncrementalHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 356 mSDtfsCounter, 898 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 797 GetRequests, 711 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 927 ConstructedInterpolants, 0 QuantifiedInterpolants, 4647 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1098 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 2205/2373 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((((((A == r) && (p == 2)) && (d == 2)) && (q == 0)) && (B == 1)) || (((((A == ((long long) r + 1)) && (d == 1)) && (B == 1)) && (q == 1)) && (p == 1))) || (((((A == r) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1))) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((0 <= A) && (A == r)) && (p == 2)) && (A <= 1)) && (d == 2)) && (q == 0)) && (B == 1)) || (((((((0 <= A) && (A == r)) && (A <= 1)) && (d == 1)) && (q == 0)) && (B == 1)) && (p == 1))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:10:10,862 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE