./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --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/hard-ll_valuebound2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9851f41ad4fb2d0ff96507e8e48f0d2886a8de6481eed845b23377b9fa492b45 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --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:06:25,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:06:25,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:06:25,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:06:25,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:06:25,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:06:25,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:06:25,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:06:25,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:06:25,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:06:25,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:06:25,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:06:25,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:06:25,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:06:25,291 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:06:25,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:06:25,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:06:25,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:06:25,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:06:25,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:06:25,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:06:25,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:06:25,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:06:25,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:06:25,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:06:25,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:06:25,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:06:25,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:06:25,297 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:06:25,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:06:25,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:06:25,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:06:25,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:06:25,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:06:25,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:06:25,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:06:25,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:06:25,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:06:25,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:06:25,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:06:25,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:06:25,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:06:25,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9851f41ad4fb2d0ff96507e8e48f0d2886a8de6481eed845b23377b9fa492b45 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.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:06:25,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:06:25,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:06:25,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:06:25,649 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:06:25,650 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:06:25,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-25 11:06:27,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:06:27,257 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:06:27,257 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c [2024-09-25 11:06:27,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/aa8ce00bb/c4f0afe2b6bb41bea5636ae2c8c5aa67/FLAG0ef0911ae [2024-09-25 11:06:27,279 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/aa8ce00bb/c4f0afe2b6bb41bea5636ae2c8c5aa67 [2024-09-25 11:06:27,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:06:27,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:06:27,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:06:27,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:06:27,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:06:27,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@280a7ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27, skipping insertion in model container [2024-09-25 11:06:27,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:06:27,484 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2024-09-25 11:06:27,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:06:27,524 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:06:27,534 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound2.c[538,551] [2024-09-25 11:06:27,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:06:27,567 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:06:27,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27 WrapperNode [2024-09-25 11:06:27,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:06:27,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:06:27,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:06:27,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:06:27,576 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:06:27" (1/1) ... [2024-09-25 11:06:27,586 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:06:27" (1/1) ... [2024-09-25 11:06:27,597 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:06:27,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:06:27,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:06:27,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:06:27,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:06:27,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,626 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 11:06:27,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,641 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:06:27,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:06:27,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:06:27,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:06:27,646 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (1/1) ... [2024-09-25 11:06:27,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:06:27,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:27,680 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:06:27,686 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:06:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:06:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:06:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:06:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:06:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:06:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:06:27,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:06:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:06:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:06:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:06:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:06:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:06:27,798 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:06:27,801 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:06:27,995 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 11:06:27,995 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:06:28,012 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:06:28,013 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 11:06:28,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:06:28 BoogieIcfgContainer [2024-09-25 11:06:28,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:06:28,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:06:28,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:06:28,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:06:28,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:06:27" (1/3) ... [2024-09-25 11:06:28,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a9e674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:06:28, skipping insertion in model container [2024-09-25 11:06:28,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:06:27" (2/3) ... [2024-09-25 11:06:28,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a9e674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:06:28, skipping insertion in model container [2024-09-25 11:06:28,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:06:28" (3/3) ... [2024-09-25 11:06:28,020 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound2.c [2024-09-25 11:06:28,036 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:06:28,036 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:06:28,088 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:06:28,096 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;@21ed74e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:06:28,096 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:06:28,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 11:06:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:06:28,106 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:28,107 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:28,107 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:28,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash 367441184, now seen corresponding path program 1 times [2024-09-25 11:06:28,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:28,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130618661] [2024-09-25 11:06:28,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:28,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:28,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:06:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:28,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:06:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:28,267 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:06:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:28,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:06:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:06:28,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:28,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130618661] [2024-09-25 11:06:28,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130618661] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:06:28,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:06:28,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 11:06:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246942717] [2024-09-25 11:06:28,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:06:28,301 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 11:06:28,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:28,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 11:06:28,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:06:28,326 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:06:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:28,368 INFO L93 Difference]: Finished difference Result 66 states and 107 transitions. [2024-09-25 11:06:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 11:06:28,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-25 11:06:28,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:28,377 INFO L225 Difference]: With dead ends: 66 [2024-09-25 11:06:28,378 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 11:06:28,381 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:06:28,386 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:28,387 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:06:28,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 11:06:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-25 11:06:28,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:06:28,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-09-25 11:06:28,432 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 27 [2024-09-25 11:06:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:28,433 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-09-25 11:06:28,433 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 11:06:28,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-09-25 11:06:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:06:28,437 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:28,437 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:28,438 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:06:28,439 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:28,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash -781266146, now seen corresponding path program 1 times [2024-09-25 11:06:28,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:28,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587567954] [2024-09-25 11:06:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:28,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:28,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:06:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:28,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:06:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:28,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:06:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:28,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:06:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:06:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587567954] [2024-09-25 11:06:28,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587567954] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:06:28,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:06:28,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:06:28,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383890513] [2024-09-25 11:06:28,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:06:28,723 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:06:28,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:28,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:06:28,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:06:28,724 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:06:28,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:28,861 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-09-25 11:06:28,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:06:28,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-25 11:06:28,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:28,865 INFO L225 Difference]: With dead ends: 45 [2024-09-25 11:06:28,865 INFO L226 Difference]: Without dead ends: 43 [2024-09-25 11:06:28,866 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:06:28,867 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:28,870 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 134 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:06:28,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-25 11:06:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-25 11:06:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:06:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-09-25 11:06:28,882 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-09-25 11:06:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:28,882 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-09-25 11:06:28,882 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:06:28,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-09-25 11:06:28,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 11:06:28,884 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:28,884 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:28,884 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:06:28,885 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:28,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:28,885 INFO L85 PathProgramCache]: Analyzing trace with hash 992341126, now seen corresponding path program 1 times [2024-09-25 11:06:28,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:28,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405396932] [2024-09-25 11:06:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:28,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:29,019 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:06:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:29,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:06:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:29,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:06:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:29,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:06:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:29,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:06:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 11:06:29,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:29,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405396932] [2024-09-25 11:06:29,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405396932] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:06:29,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:06:29,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:06:29,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223816054] [2024-09-25 11:06:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:06:29,048 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:06:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:06:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:06:29,049 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-25 11:06:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:29,118 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-09-25 11:06:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:06:29,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-25 11:06:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:29,120 INFO L225 Difference]: With dead ends: 49 [2024-09-25 11:06:29,120 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 11:06:29,121 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:06:29,122 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:29,122 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 131 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:06:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 11:06:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2024-09-25 11:06:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 11:06:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-09-25 11:06:29,131 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 32 [2024-09-25 11:06:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:29,132 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-09-25 11:06:29,132 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:06:29,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-09-25 11:06:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 11:06:29,135 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:29,136 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:29,136 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 11:06:29,137 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:29,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1500804130, now seen corresponding path program 1 times [2024-09-25 11:06:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:29,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331245772] [2024-09-25 11:06:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:06:29,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573819189] [2024-09-25 11:06:29,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:29,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:29,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:29,179 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:06:29,181 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:06:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:29,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 11:06:29,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-25 11:06:29,349 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:06:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:29,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331245772] [2024-09-25 11:06:29,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:06:29,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573819189] [2024-09-25 11:06:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573819189] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:06:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:06:29,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:06:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893067485] [2024-09-25 11:06:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:06:29,353 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:06:29,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:29,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:06:29,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:06:29,354 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-25 11:06:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:29,449 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2024-09-25 11:06:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:06:29,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-09-25 11:06:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:29,451 INFO L225 Difference]: With dead ends: 66 [2024-09-25 11:06:29,451 INFO L226 Difference]: Without dead ends: 53 [2024-09-25 11:06:29,451 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:06:29,452 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:29,452 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 132 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:06:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-25 11:06:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-09-25 11:06:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 17 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-25 11:06:29,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-09-25 11:06:29,474 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 37 [2024-09-25 11:06:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:29,476 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-09-25 11:06:29,476 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-25 11:06:29,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-09-25 11:06:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-25 11:06:29,478 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:29,478 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:29,497 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 11:06:29,682 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:06:29,683 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:29,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:29,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1357220557, now seen corresponding path program 1 times [2024-09-25 11:06:29,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:29,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495316285] [2024-09-25 11:06:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:29,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:06:29,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [398614737] [2024-09-25 11:06:29,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:29,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:29,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:29,711 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:06:29,717 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:06:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:29,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-25 11:06:29,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-25 11:06:29,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:06:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-25 11:06:30,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:30,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495316285] [2024-09-25 11:06:30,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:06:30,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398614737] [2024-09-25 11:06:30,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398614737] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:06:30,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:06:30,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-25 11:06:30,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625720701] [2024-09-25 11:06:30,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:06:30,107 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 11:06:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:30,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 11:06:30,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-25 11:06:30,111 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 11:06:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:30,236 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-09-25 11:06:30,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:06:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 44 [2024-09-25 11:06:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:30,240 INFO L225 Difference]: With dead ends: 68 [2024-09-25 11:06:30,242 INFO L226 Difference]: Without dead ends: 66 [2024-09-25 11:06:30,243 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:06:30,244 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:30,244 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 147 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:06:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-25 11:06:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2024-09-25 11:06:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-25 11:06:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2024-09-25 11:06:30,271 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 44 [2024-09-25 11:06:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:30,272 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2024-09-25 11:06:30,272 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 11:06:30,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2024-09-25 11:06:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-25 11:06:30,277 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:30,277 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:30,295 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 11:06:30,478 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:06:30,478 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:30,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1728018148, now seen corresponding path program 1 times [2024-09-25 11:06:30,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:30,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682141404] [2024-09-25 11:06:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:30,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:06:30,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1401870903] [2024-09-25 11:06:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:30,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:30,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:30,512 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:06:30,515 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:06:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:30,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 11:06:30,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-09-25 11:06:30,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:06:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-09-25 11:06:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682141404] [2024-09-25 11:06:30,761 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:06:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401870903] [2024-09-25 11:06:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401870903] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 11:06:30,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:06:30,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-25 11:06:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557761249] [2024-09-25 11:06:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:06:30,762 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:06:30,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:30,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:06:30,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:06:30,763 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 11:06:30,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:30,834 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-09-25 11:06:30,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:06:30,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2024-09-25 11:06:30,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:30,836 INFO L225 Difference]: With dead ends: 73 [2024-09-25 11:06:30,836 INFO L226 Difference]: Without dead ends: 71 [2024-09-25 11:06:30,836 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:06:30,837 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:30,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:06:30,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-25 11:06:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-25 11:06:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-25 11:06:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2024-09-25 11:06:30,853 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 54 [2024-09-25 11:06:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:30,854 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2024-09-25 11:06:30,854 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-25 11:06:30,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:30,854 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2024-09-25 11:06:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-09-25 11:06:30,855 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:30,856 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:30,872 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 11:06:31,056 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:06:31,057 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:31,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 515743006, now seen corresponding path program 1 times [2024-09-25 11:06:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:31,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183348359] [2024-09-25 11:06:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:31,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:06:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:06:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:06:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:06:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:06:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,184 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:06:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:06:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:06:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 11:06:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-25 11:06:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-09-25 11:06:31,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:31,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183348359] [2024-09-25 11:06:31,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183348359] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:06:31,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:06:31,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:06:31,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12374695] [2024-09-25 11:06:31,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:06:31,229 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:06:31,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:31,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:06:31,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:06:31,232 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-25 11:06:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:31,296 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2024-09-25 11:06:31,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:06:31,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2024-09-25 11:06:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:31,299 INFO L225 Difference]: With dead ends: 78 [2024-09-25 11:06:31,299 INFO L226 Difference]: Without dead ends: 66 [2024-09-25 11:06:31,299 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:06:31,301 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:31,301 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 142 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:06:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-25 11:06:31,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-09-25 11:06:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 20 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-25 11:06:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-09-25 11:06:31,322 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 60 [2024-09-25 11:06:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:31,322 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-09-25 11:06:31,322 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-09-25 11:06:31,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-09-25 11:06:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-09-25 11:06:31,324 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:31,324 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:31,324 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 11:06:31,327 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:31,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:31,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1452252536, now seen corresponding path program 1 times [2024-09-25 11:06:31,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:31,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70159347] [2024-09-25 11:06:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:31,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:06:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41743705] [2024-09-25 11:06:31,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:31,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:31,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:31,360 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:06:31,361 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:06:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:31,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-25 11:06:31,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-09-25 11:06:32,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:06:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-09-25 11:06:33,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:33,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70159347] [2024-09-25 11:06:33,807 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:06:33,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41743705] [2024-09-25 11:06:33,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41743705] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:06:33,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:06:33,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-25 11:06:33,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752612534] [2024-09-25 11:06:33,808 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:06:33,809 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 11:06:33,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 11:06:33,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-09-25 11:06:33,811 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 9 states have call predecessors, (23), 8 states have call successors, (23) [2024-09-25 11:06:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:35,004 INFO L93 Difference]: Finished difference Result 152 states and 208 transitions. [2024-09-25 11:06:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 11:06:35,005 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 9 states have call predecessors, (23), 8 states have call successors, (23) Word has length 74 [2024-09-25 11:06:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:35,007 INFO L225 Difference]: With dead ends: 152 [2024-09-25 11:06:35,007 INFO L226 Difference]: Without dead ends: 129 [2024-09-25 11:06:35,008 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=592, Unknown=0, NotChecked=0, Total=756 [2024-09-25 11:06:35,008 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 73 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:35,009 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 308 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 11:06:35,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-09-25 11:06:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2024-09-25 11:06:35,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-09-25 11:06:35,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 132 transitions. [2024-09-25 11:06:35,043 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 132 transitions. Word has length 74 [2024-09-25 11:06:35,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:35,044 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 132 transitions. [2024-09-25 11:06:35,044 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 10 states have call successors, (25), 3 states have call predecessors, (25), 2 states have return successors, (23), 9 states have call predecessors, (23), 8 states have call successors, (23) [2024-09-25 11:06:35,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 132 transitions. [2024-09-25 11:06:35,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-25 11:06:35,046 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:35,046 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:35,064 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 11:06:35,250 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:06:35,251 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:35,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1571705391, now seen corresponding path program 1 times [2024-09-25 11:06:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:35,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336142403] [2024-09-25 11:06:35,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:35,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:06:35,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1580712239] [2024-09-25 11:06:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:35,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:35,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:35,304 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:06:35,308 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:06:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:35,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 11:06:35,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-09-25 11:06:35,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:06:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-25 11:06:36,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:36,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336142403] [2024-09-25 11:06:36,399 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:06:36,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580712239] [2024-09-25 11:06:36,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580712239] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:06:36,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:06:36,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-25 11:06:36,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975935443] [2024-09-25 11:06:36,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:06:36,400 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 11:06:36,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:36,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 11:06:36,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-09-25 11:06:36,401 INFO L87 Difference]: Start difference. First operand 105 states and 132 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-25 11:06:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:36,872 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2024-09-25 11:06:36,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 11:06:36,873 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) Word has length 85 [2024-09-25 11:06:36,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:36,874 INFO L225 Difference]: With dead ends: 145 [2024-09-25 11:06:36,874 INFO L226 Difference]: Without dead ends: 111 [2024-09-25 11:06:36,875 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2024-09-25 11:06:36,876 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 26 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:36,876 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 350 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:06:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-25 11:06:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-09-25 11:06:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 59 states have internal predecessors, (66), 27 states have call successors, (27), 13 states have call predecessors, (27), 12 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-09-25 11:06:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2024-09-25 11:06:36,909 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 85 [2024-09-25 11:06:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:36,909 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2024-09-25 11:06:36,910 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 9 states have call successors, (25) [2024-09-25 11:06:36,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2024-09-25 11:06:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-25 11:06:36,911 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:36,911 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:36,925 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:06:37,111 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:06:37,112 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:37,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1973508941, now seen corresponding path program 2 times [2024-09-25 11:06:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:37,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601800284] [2024-09-25 11:06:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:37,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:06:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:06:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:06:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:06:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:06:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:06:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:06:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:06:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 11:06:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 11:06:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 11:06:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 11:06:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-25 11:06:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-25 11:06:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-25 11:06:37,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:37,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601800284] [2024-09-25 11:06:37,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601800284] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:06:37,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217098623] [2024-09-25 11:06:37,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:06:37,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:37,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:37,365 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:06:37,367 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:06:37,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:06:37,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:06:37,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 11:06:37,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-25 11:06:37,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:06:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-25 11:06:37,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217098623] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:06:37,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:06:37,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-09-25 11:06:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642473966] [2024-09-25 11:06:37,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:06:37,542 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:06:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:06:37,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:06:37,545 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-09-25 11:06:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:37,628 INFO L93 Difference]: Finished difference Result 124 states and 155 transitions. [2024-09-25 11:06:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 11:06:37,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 87 [2024-09-25 11:06:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:37,633 INFO L225 Difference]: With dead ends: 124 [2024-09-25 11:06:37,633 INFO L226 Difference]: Without dead ends: 102 [2024-09-25 11:06:37,634 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:06:37,634 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:37,636 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:06:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-09-25 11:06:37,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-09-25 11:06:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-25 11:06:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-09-25 11:06:37,690 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 87 [2024-09-25 11:06:37,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:37,690 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-09-25 11:06:37,690 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 5 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-09-25 11:06:37,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:37,691 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-09-25 11:06:37,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-09-25 11:06:37,692 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:37,692 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:37,708 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:06:37,896 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:06:37,897 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:37,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:37,897 INFO L85 PathProgramCache]: Analyzing trace with hash -637517709, now seen corresponding path program 1 times [2024-09-25 11:06:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212728923] [2024-09-25 11:06:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:06:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,145 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:06:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:06:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,149 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:06:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:06:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:06:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,156 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:06:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,159 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:06:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 11:06:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 11:06:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 11:06:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 11:06:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-25 11:06:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-25 11:06:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,208 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-25 11:06:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-25 11:06:38,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:38,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212728923] [2024-09-25 11:06:38,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212728923] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:06:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888809138] [2024-09-25 11:06:38,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:38,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:38,214 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:06:38,215 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:06:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:38,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-25 11:06:38,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-09-25 11:06:38,560 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:06:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-25 11:06:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888809138] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:06:38,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:06:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 18 [2024-09-25 11:06:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213650933] [2024-09-25 11:06:38,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:06:38,921 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 11:06:38,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:38,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 11:06:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-09-25 11:06:38,923 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-25 11:06:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:39,243 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2024-09-25 11:06:39,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 11:06:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) Word has length 90 [2024-09-25 11:06:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:39,245 INFO L225 Difference]: With dead ends: 117 [2024-09-25 11:06:39,245 INFO L226 Difference]: Without dead ends: 100 [2024-09-25 11:06:39,246 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-09-25 11:06:39,246 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:39,247 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 389 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:06:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-25 11:06:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2024-09-25 11:06:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 57 states have internal predecessors, (63), 25 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-25 11:06:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2024-09-25 11:06:39,275 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 90 [2024-09-25 11:06:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:39,275 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2024-09-25 11:06:39,275 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.388888888888889) internal successors, (43), 15 states have internal predecessors, (43), 10 states have call successors, (35), 3 states have call predecessors, (35), 2 states have return successors, (33), 11 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-25 11:06:39,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:39,276 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2024-09-25 11:06:39,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-09-25 11:06:39,277 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:39,277 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:39,298 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 11:06:39,481 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:06:39,482 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:39,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1204328542, now seen corresponding path program 1 times [2024-09-25 11:06:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:39,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730541231] [2024-09-25 11:06:39,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:06:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:06:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:06:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:06:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:06:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:06:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:06:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:06:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 11:06:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 11:06:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 11:06:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 11:06:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-25 11:06:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,592 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-25 11:06:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-25 11:06:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-25 11:06:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,600 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-25 11:06:39,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:39,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730541231] [2024-09-25 11:06:39,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730541231] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:06:39,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652718290] [2024-09-25 11:06:39,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:39,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:39,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:39,602 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:06:39,608 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 11:06:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:39,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 11:06:39,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-09-25 11:06:39,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:06:39,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652718290] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:06:39,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:06:39,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-09-25 11:06:39,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061600422] [2024-09-25 11:06:39,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:06:39,687 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:06:39,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:39,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:06:39,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:06:39,688 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-25 11:06:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:39,752 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-09-25 11:06:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:06:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 94 [2024-09-25 11:06:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:39,754 INFO L225 Difference]: With dead ends: 100 [2024-09-25 11:06:39,754 INFO L226 Difference]: Without dead ends: 88 [2024-09-25 11:06:39,754 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:06:39,755 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:39,755 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 120 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:06:39,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-25 11:06:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-25 11:06:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-25 11:06:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2024-09-25 11:06:39,782 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 94 [2024-09-25 11:06:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:39,783 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2024-09-25 11:06:39,783 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 5 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-25 11:06:39,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:39,784 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2024-09-25 11:06:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-09-25 11:06:39,785 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:39,785 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:39,803 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 11:06:39,985 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:39,986 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:39,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:39,986 INFO L85 PathProgramCache]: Analyzing trace with hash -588826413, now seen corresponding path program 3 times [2024-09-25 11:06:39,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:39,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261977612] [2024-09-25 11:06:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:39,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:06:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:06:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:06:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:06:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:06:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,577 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:06:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:06:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:06:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 11:06:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 11:06:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 11:06:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 11:06:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-25 11:06:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-25 11:06:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-25 11:06:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-25 11:06:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-25 11:06:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:40,685 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 30 proven. 26 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-25 11:06:40,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261977612] [2024-09-25 11:06:40,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261977612] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:06:40,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398663396] [2024-09-25 11:06:40,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 11:06:40,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:40,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:40,689 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:06:40,698 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 11:06:40,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 11:06:40,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:06:40,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-25 11:06:40,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-25 11:06:41,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:06:41,997 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 33 proven. 23 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2024-09-25 11:06:41,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398663396] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:06:41,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:06:41,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2024-09-25 11:06:41,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746432120] [2024-09-25 11:06:41,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:06:41,998 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 11:06:41,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 11:06:41,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-09-25 11:06:42,000 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 25 states, 25 states have (on average 2.28) internal successors, (57), 23 states have internal predecessors, (57), 16 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) [2024-09-25 11:06:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:42,537 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2024-09-25 11:06:42,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 11:06:42,537 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 23 states have internal predecessors, (57), 16 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) Word has length 104 [2024-09-25 11:06:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:42,538 INFO L225 Difference]: With dead ends: 153 [2024-09-25 11:06:42,539 INFO L226 Difference]: Without dead ends: 101 [2024-09-25 11:06:42,539 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 230 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2024-09-25 11:06:42,540 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 50 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:42,541 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 502 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:06:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-09-25 11:06:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2024-09-25 11:06:42,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 24 states have call successors, (24), 12 states have call predecessors, (24), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-25 11:06:42,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2024-09-25 11:06:42,573 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 104 [2024-09-25 11:06:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:42,574 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2024-09-25 11:06:42,574 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.28) internal successors, (57), 23 states have internal predecessors, (57), 16 states have call successors, (45), 2 states have call predecessors, (45), 2 states have return successors, (45), 17 states have call predecessors, (45), 15 states have call successors, (45) [2024-09-25 11:06:42,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2024-09-25 11:06:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-09-25 11:06:42,576 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:42,576 INFO L216 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:42,583 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 11:06:42,780 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-25 11:06:42,781 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:42,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1394769075, now seen corresponding path program 1 times [2024-09-25 11:06:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:42,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553661686] [2024-09-25 11:06:42,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:42,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:06:42,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574913768] [2024-09-25 11:06:42,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:42,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:42,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:42,809 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:06:42,812 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 11:06:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:42,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-25 11:06:42,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-09-25 11:06:43,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:06:45,472 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2024-09-25 11:06:45,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:45,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553661686] [2024-09-25 11:06:45,473 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:06:45,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574913768] [2024-09-25 11:06:45,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574913768] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:06:45,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:06:45,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 29 [2024-09-25 11:06:45,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635313005] [2024-09-25 11:06:45,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:06:45,474 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-25 11:06:45,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:45,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-25 11:06:45,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2024-09-25 11:06:45,475 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 16 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35) [2024-09-25 11:06:46,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:46,238 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2024-09-25 11:06:46,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 11:06:46,239 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 16 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35) Word has length 109 [2024-09-25 11:06:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:46,240 INFO L225 Difference]: With dead ends: 117 [2024-09-25 11:06:46,240 INFO L226 Difference]: Without dead ends: 95 [2024-09-25 11:06:46,241 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2024-09-25 11:06:46,241 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:46,242 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 473 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 11:06:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-25 11:06:46,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-09-25 11:06:46,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 59 states have internal predecessors, (59), 22 states have call successors, (22), 15 states have call predecessors, (22), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-25 11:06:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2024-09-25 11:06:46,275 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 109 [2024-09-25 11:06:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:46,276 INFO L474 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2024-09-25 11:06:46,277 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 16 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (35), 14 states have call predecessors, (35), 16 states have call successors, (35) [2024-09-25 11:06:46,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2024-09-25 11:06:46,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-25 11:06:46,278 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:46,278 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:46,293 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-25 11:06:46,482 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-25 11:06:46,483 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:46,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:46,483 INFO L85 PathProgramCache]: Analyzing trace with hash 733497000, now seen corresponding path program 1 times [2024-09-25 11:06:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:46,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213560365] [2024-09-25 11:06:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:46,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:06:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950930266] [2024-09-25 11:06:46,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:46,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:46,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:46,526 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:06:46,527 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 11:06:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:46,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-09-25 11:06:46,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 64 proven. 72 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-09-25 11:06:47,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:06:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213560365] [2024-09-25 11:06:48,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:06:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950930266] [2024-09-25 11:06:48,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950930266] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:06:48,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:06:48,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-09-25 11:06:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600633696] [2024-09-25 11:06:48,678 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-25 11:06:48,679 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 11:06:48,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 11:06:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-09-25 11:06:48,680 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2024-09-25 11:06:49,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:49,186 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-09-25 11:06:49,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 11:06:49,187 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) Word has length 115 [2024-09-25 11:06:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:49,188 INFO L225 Difference]: With dead ends: 101 [2024-09-25 11:06:49,188 INFO L226 Difference]: Without dead ends: 97 [2024-09-25 11:06:49,188 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2024-09-25 11:06:49,189 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:49,189 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 405 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 11:06:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-09-25 11:06:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-09-25 11:06:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.0) internal successors, (60), 60 states have internal predecessors, (60), 22 states have call successors, (22), 16 states have call predecessors, (22), 14 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-09-25 11:06:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-09-25 11:06:49,218 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 115 [2024-09-25 11:06:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:49,219 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-09-25 11:06:49,219 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.0) internal successors, (30), 14 states have internal predecessors, (30), 9 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2024-09-25 11:06:49,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:49,219 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-09-25 11:06:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-09-25 11:06:49,220 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:06:49,220 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:49,237 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-25 11:06:49,423 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-25 11:06:49,423 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:06:49,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:49,424 INFO L85 PathProgramCache]: Analyzing trace with hash 265983484, now seen corresponding path program 1 times [2024-09-25 11:06:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:06:49,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446983521] [2024-09-25 11:06:49,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:49,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:06:49,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,783 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:06:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,785 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:06:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:06:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 11:06:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 11:06:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-25 11:06:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 11:06:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 11:06:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-25 11:06:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-09-25 11:06:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 11:06:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 11:06:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,815 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-09-25 11:06:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-09-25 11:06:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,822 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-09-25 11:06:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,826 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-09-25 11:06:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-25 11:06:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-25 11:06:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-25 11:06:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-25 11:06:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-09-25 11:06:49,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:06:49,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446983521] [2024-09-25 11:06:49,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446983521] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:06:49,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423394499] [2024-09-25 11:06:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:06:49,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:06:49,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:06:49,847 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:06:49,847 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-25 11:06:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:06:49,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 11:06:49,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:06:50,281 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 31 proven. 74 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-25 11:06:50,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:06:51,026 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 31 proven. 74 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2024-09-25 11:06:51,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423394499] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:06:51,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:06:51,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 12] total 26 [2024-09-25 11:06:51,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046948662] [2024-09-25 11:06:51,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:06:51,027 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-25 11:06:51,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:06:51,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-25 11:06:51,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-09-25 11:06:51,028 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 17 states have call predecessors, (49), 19 states have call successors, (49) [2024-09-25 11:06:51,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:06:51,389 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-09-25 11:06:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 11:06:51,389 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 17 states have call predecessors, (49), 19 states have call successors, (49) Word has length 120 [2024-09-25 11:06:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:06:51,390 INFO L225 Difference]: With dead ends: 97 [2024-09-25 11:06:51,390 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:06:51,391 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=846, Unknown=0, NotChecked=0, Total=992 [2024-09-25 11:06:51,392 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:06:51,392 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 354 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:06:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:06:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:06:51,393 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:06:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:06:51,394 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2024-09-25 11:06:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:06:51,394 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:06:51,394 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 23 states have internal predecessors, (61), 19 states have call successors, (52), 3 states have call predecessors, (52), 2 states have return successors, (49), 17 states have call predecessors, (49), 19 states have call successors, (49) [2024-09-25 11:06:51,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:06:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:06:51,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:06:51,397 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:06:51,413 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-25 11:06:51,601 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-25 11:06:51,605 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:06:51,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:06:53,345 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:06:53,376 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:06:53,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:06:53,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:06:53,378 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:06:53,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:06:53,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:06:53,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:06:53,379 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:06:53,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:06:53,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:06:53,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:06:53,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:06:53,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:06:53,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:06:53,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:06:53,380 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:06:53,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:06:53,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:06:53,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:06:53,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:06:53,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:06:53,381 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:06:53,384 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:06:53,384 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:06:53,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:06:53 BoogieIcfgContainer [2024-09-25 11:06:53,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:06:53,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:06:53,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:06:53,386 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:06:53,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:06:28" (3/4) ... [2024-09-25 11:06:53,388 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:06:53,441 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:06:53,441 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:06:53,442 INFO L158 Benchmark]: Toolchain (without parser) took 26158.64ms. Allocated memory was 56.6MB in the beginning and 264.2MB in the end (delta: 207.6MB). Free memory was 25.9MB in the beginning and 177.4MB in the end (delta: -151.5MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2024-09-25 11:06:53,442 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 33.1MB in the beginning and 33.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:06:53,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.69ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 25.7MB in the beginning and 42.8MB in the end (delta: -17.1MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2024-09-25 11:06:53,442 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.52ms. Allocated memory is still 71.3MB. Free memory was 42.8MB in the beginning and 41.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:06:53,443 INFO L158 Benchmark]: Boogie Preprocessor took 45.66ms. Allocated memory is still 71.3MB. Free memory was 41.7MB in the beginning and 39.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:06:53,443 INFO L158 Benchmark]: RCFGBuilder took 368.49ms. Allocated memory is still 71.3MB. Free memory was 39.9MB in the beginning and 45.8MB in the end (delta: -5.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 11:06:53,443 INFO L158 Benchmark]: TraceAbstraction took 25370.19ms. Allocated memory was 71.3MB in the beginning and 264.2MB in the end (delta: 192.9MB). Free memory was 45.2MB in the beginning and 179.5MB in the end (delta: -134.3MB). Peak memory consumption was 156.0MB. Max. memory is 16.1GB. [2024-09-25 11:06:53,444 INFO L158 Benchmark]: Witness Printer took 55.73ms. Allocated memory is still 264.2MB. Free memory was 179.5MB in the beginning and 177.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:06:53,446 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 33.1MB in the beginning and 33.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.69ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 25.7MB in the beginning and 42.8MB in the end (delta: -17.1MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.52ms. Allocated memory is still 71.3MB. Free memory was 42.8MB in the beginning and 41.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.66ms. Allocated memory is still 71.3MB. Free memory was 41.7MB in the beginning and 39.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.49ms. Allocated memory is still 71.3MB. Free memory was 39.9MB in the beginning and 45.8MB in the end (delta: -5.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25370.19ms. Allocated memory was 71.3MB in the beginning and 264.2MB in the end (delta: 192.9MB). Free memory was 45.2MB in the beginning and 179.5MB in the end (delta: -134.3MB). Peak memory consumption was 156.0MB. Max. memory is 16.1GB. * Witness Printer took 55.73ms. Allocated memory is still 264.2MB. Free memory was 179.5MB in the beginning and 177.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: #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: #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: #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, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.5s, OverallIterations: 16, TraceHistogramMax: 17, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 3912 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3270 mSDsCounter, 326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2541 IncrementalHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 326 mSolverCounterUnsat, 642 mSDtfsCounter, 2541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2120 GetRequests, 1884 SyntacticMatches, 6 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=8, InterpolantAutomatonStates: 149, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 75 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 2172 NumberOfCodeBlocks, 2145 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2391 ConstructedInterpolants, 0 QuantifiedInterpolants, 15679 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2175 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 6714/7295 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((((((0 <= r) && (((__int128) r + 1) <= d)) && (((__int128) d + r) == A)) && (((__int128) r + ((long long) 2 * B)) == ((__int128) A + d))) && (q == 1)) && (A <= 2)) && (p == 1)) || ((((((B == 1) && (r == 0)) && (q == 2)) && (p == 2)) && (A == 2)) && (d == 2))) || (((((((A == r) && (d == ((long long) 2 * B))) && (((__int128) r + 1) <= d)) && (p == 2)) && (q == 0)) && (A <= 2)) && (B <= r))) || ((((((B == 1) && (r == 0)) && (q == 2)) && (A == 2)) && (d == 1)) && (p == 1))) || ((((d == B) && (A == r)) && (q == 0)) && (p == 1))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((__int128) A + d) == ((__int128) ((long long) B * 4) + r))) && (q == 0)) && (p == 4)) && ((A + (d / 2)) == ((__int128) r + ((long long) 2 * B)))) && (1 <= d)) && (A <= 2))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((d == B) && (A == r)) && (q == 0)) && (1 <= d)) && (A <= 2)) && (p == 1)) || (((((((A == r) && (d == ((long long) 2 * B))) && (p == 2)) && (q == 0)) && (1 <= d)) && (A <= 2)) && (B <= r))) || (((((((0 <= (r + (((__int128) -1 * d) / 2))) && (((__int128) A + d) == ((__int128) ((long long) B * 4) + r))) && (q == 0)) && (p == 4)) && ((A + (d / 2)) == ((__int128) r + ((long long) 2 * B)))) && (1 <= d)) && (A <= 2))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:06:53,510 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE