./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/hh2012-ex3.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/hh2012-ex3.i -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 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-17 18:17:46,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 18:17:46,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 18:17:46,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 18:17:46,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 18:17:46,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 18:17:46,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 18:17:46,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 18:17:46,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 18:17:46,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 18:17:46,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 18:17:46,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 18:17:46,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 18:17:46,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 18:17:46,668 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 18:17:46,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 18:17:46,669 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 18:17:46,669 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 18:17:46,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 18:17:46,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 18:17:46,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 18:17:46,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 18:17:46,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 18:17:46,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 18:17:46,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 18:17:46,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 18:17:46,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 18:17:46,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 18:17:46,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 18:17:46,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 18:17:46,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 18:17:46,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 18:17:46,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:17:46,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 18:17:46,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 18:17:46,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 18:17:46,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 18:17:46,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 18:17:46,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 18:17:46,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 18:17:46,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 18:17:46,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 18:17:46,678 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 -> 3c7177334f88b94ca4ee99044935e396702561856a6f48616f98f91aafc609bb Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-17 18:17:46,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 18:17:46,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 18:17:46,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 18:17:46,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 18:17:46,937 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 18:17:46,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-17 18:17:48,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 18:17:48,591 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 18:17:48,592 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/hh2012-ex3.i [2024-09-17 18:17:48,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/be8dedd05/abb3cb8aa0ea41abbd72fb034eddf379/FLAG68873de01 [2024-09-17 18:17:48,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/be8dedd05/abb3cb8aa0ea41abbd72fb034eddf379 [2024-09-17 18:17:48,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 18:17:48,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 18:17:48,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 18:17:48,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 18:17:48,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 18:17:48,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:17:48" (1/1) ... [2024-09-17 18:17:48,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e129ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:48, skipping insertion in model container [2024-09-17 18:17:48,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:17:48" (1/1) ... [2024-09-17 18:17:49,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 18:17:49,168 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/loop-lit/hh2012-ex3.i[799,812] [2024-09-17 18:17:49,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:17:49,203 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 18:17:49,216 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/loop-lit/hh2012-ex3.i[799,812] [2024-09-17 18:17:49,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:17:49,239 INFO L204 MainTranslator]: Completed translation [2024-09-17 18:17:49,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49 WrapperNode [2024-09-17 18:17:49,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 18:17:49,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 18:17:49,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 18:17:49,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 18:17:49,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,291 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 18:17:49,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 18:17:49,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 18:17:49,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 18:17:49,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 18:17:49,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,339 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-17 18:17:49,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 18:17:49,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 18:17:49,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 18:17:49,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 18:17:49,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (1/1) ... [2024-09-17 18:17:49,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:17:49,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:17:49,409 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-17 18:17:49,412 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-17 18:17:49,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 18:17:49,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 18:17:49,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 18:17:49,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 18:17:49,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 18:17:49,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 18:17:49,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 18:17:49,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 18:17:49,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 18:17:49,461 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 18:17:49,528 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 18:17:49,531 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 18:17:49,694 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-17 18:17:49,694 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 18:17:49,720 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 18:17:49,721 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-17 18:17:49,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:17:49 BoogieIcfgContainer [2024-09-17 18:17:49,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 18:17:49,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 18:17:49,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 18:17:49,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 18:17:49,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 06:17:48" (1/3) ... [2024-09-17 18:17:49,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da3a08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:17:49, skipping insertion in model container [2024-09-17 18:17:49,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:17:49" (2/3) ... [2024-09-17 18:17:49,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da3a08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:17:49, skipping insertion in model container [2024-09-17 18:17:49,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:17:49" (3/3) ... [2024-09-17 18:17:49,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hh2012-ex3.i [2024-09-17 18:17:49,749 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 18:17:49,749 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 18:17:49,813 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 18:17:49,821 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;@7b03571c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 18:17:49,822 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 18:17:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-17 18:17:49,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-17 18:17:49,834 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:17:49,835 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:17:49,836 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:17:49,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1205805759, now seen corresponding path program 1 times [2024-09-17 18:17:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:17:49,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959128007] [2024-09-17 18:17:49,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:49,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:17:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:50,076 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:17:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 18:17:50,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:17:50,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959128007] [2024-09-17 18:17:50,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959128007] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:17:50,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:17:50,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-17 18:17:50,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919777874] [2024-09-17 18:17:50,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:17:50,100 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-17 18:17:50,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:17:50,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-17 18:17:50,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-17 18:17:50,129 INFO L87 Difference]: Start difference. First operand has 26 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 13 states have internal predecessors, (17), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:17:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:17:50,185 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2024-09-17 18:17:50,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-17 18:17:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-17 18:17:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:17:50,194 INFO L225 Difference]: With dead ends: 48 [2024-09-17 18:17:50,195 INFO L226 Difference]: Without dead ends: 23 [2024-09-17 18:17:50,199 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-17 18:17:50,205 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 18:17:50,206 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 18:17:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-17 18:17:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-17 18:17:50,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-17 18:17:50,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-09-17 18:17:50,250 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 11 [2024-09-17 18:17:50,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:17:50,250 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-09-17 18:17:50,250 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:17:50,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:50,251 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-09-17 18:17:50,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-17 18:17:50,252 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:17:50,252 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:17:50,253 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 18:17:50,253 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:17:50,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1204197045, now seen corresponding path program 1 times [2024-09-17 18:17:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:17:50,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968054469] [2024-09-17 18:17:50,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:50,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:17:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:50,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:17:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 18:17:50,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:17:50,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968054469] [2024-09-17 18:17:50,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968054469] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:17:50,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:17:50,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-17 18:17:50,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167721566] [2024-09-17 18:17:50,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:17:50,398 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 18:17:50,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:17:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 18:17:50,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:17:50,399 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:17:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:17:50,511 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-09-17 18:17:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:17:50,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-17 18:17:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:17:50,512 INFO L225 Difference]: With dead ends: 29 [2024-09-17 18:17:50,513 INFO L226 Difference]: Without dead ends: 27 [2024-09-17 18:17:50,514 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:17:50,516 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:17:50,517 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 88 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:17:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-17 18:17:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-17 18:17:50,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-17 18:17:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-09-17 18:17:50,535 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2024-09-17 18:17:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:17:50,536 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-09-17 18:17:50,536 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-17 18:17:50,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-09-17 18:17:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-17 18:17:50,538 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:17:50,538 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:17:50,539 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-17 18:17:50,541 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:17:50,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:50,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1149323679, now seen corresponding path program 1 times [2024-09-17 18:17:50,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:17:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377415632] [2024-09-17 18:17:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:50,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:17:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:50,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:17:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:50,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-17 18:17:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 18:17:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:17:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377415632] [2024-09-17 18:17:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377415632] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:17:50,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:17:50,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:17:50,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25262646] [2024-09-17 18:17:50,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:17:50,701 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:17:50,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:17:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:17:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:17:50,702 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-17 18:17:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:17:50,812 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2024-09-17 18:17:50,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 18:17:50,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-09-17 18:17:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:17:50,814 INFO L225 Difference]: With dead ends: 45 [2024-09-17 18:17:50,814 INFO L226 Difference]: Without dead ends: 43 [2024-09-17 18:17:50,814 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-17 18:17:50,815 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:17:50,816 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:17:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-17 18:17:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-09-17 18:17:50,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-17 18:17:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-09-17 18:17:50,836 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 16 [2024-09-17 18:17:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:17:50,837 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-09-17 18:17:50,837 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-17 18:17:50,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:50,838 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-09-17 18:17:50,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-17 18:17:50,838 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:17:50,838 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:17:50,839 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-17 18:17:50,839 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:17:50,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash 429495691, now seen corresponding path program 1 times [2024-09-17 18:17:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:17:50,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872875461] [2024-09-17 18:17:50,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:17:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:17:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,037 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-17 18:17:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-17 18:17:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-17 18:17:51,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:17:51,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872875461] [2024-09-17 18:17:51,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872875461] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:17:51,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:17:51,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:17:51,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021948778] [2024-09-17 18:17:51,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:17:51,054 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:17:51,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:17:51,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:17:51,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:17:51,055 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-17 18:17:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:17:51,135 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2024-09-17 18:17:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 18:17:51,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-17 18:17:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:17:51,137 INFO L225 Difference]: With dead ends: 49 [2024-09-17 18:17:51,137 INFO L226 Difference]: Without dead ends: 47 [2024-09-17 18:17:51,138 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-17 18:17:51,139 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:17:51,139 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:17:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-17 18:17:51,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-09-17 18:17:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-17 18:17:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-09-17 18:17:51,151 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 21 [2024-09-17 18:17:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:17:51,151 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-09-17 18:17:51,151 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-17 18:17:51,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-09-17 18:17:51,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-17 18:17:51,152 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:17:51,153 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:17:51,153 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-17 18:17:51,153 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:17:51,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1103951071, now seen corresponding path program 1 times [2024-09-17 18:17:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:17:51,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119854880] [2024-09-17 18:17:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:17:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:17:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-17 18:17:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-17 18:17:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 18:17:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-17 18:17:51,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:17:51,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119854880] [2024-09-17 18:17:51,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119854880] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:17:51,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:17:51,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-17 18:17:51,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292595378] [2024-09-17 18:17:51,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:17:51,274 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 18:17:51,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:17:51,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 18:17:51,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:17:51,276 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-17 18:17:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:17:51,355 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2024-09-17 18:17:51,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:17:51,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 26 [2024-09-17 18:17:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:17:51,364 INFO L225 Difference]: With dead ends: 92 [2024-09-17 18:17:51,366 INFO L226 Difference]: Without dead ends: 59 [2024-09-17 18:17:51,367 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:17:51,369 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:17:51,369 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:17:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-17 18:17:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-17 18:17:51,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 25 states have call successors, (25), 7 states have call predecessors, (25), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-17 18:17:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2024-09-17 18:17:51,388 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 79 transitions. Word has length 26 [2024-09-17 18:17:51,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:17:51,388 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 79 transitions. [2024-09-17 18:17:51,388 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-17 18:17:51,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:51,389 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 79 transitions. [2024-09-17 18:17:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-17 18:17:51,393 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:17:51,393 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:17:51,393 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-17 18:17:51,394 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:17:51,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:51,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1044941344, now seen corresponding path program 1 times [2024-09-17 18:17:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:17:51,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462485417] [2024-09-17 18:17:51,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:17:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:17:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-17 18:17:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-17 18:17:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 18:17:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-17 18:17:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 18:17:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 18:17:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-17 18:17:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-09-17 18:17:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:17:51,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462485417] [2024-09-17 18:17:51,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462485417] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:17:51,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:17:51,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 18:17:51,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796933722] [2024-09-17 18:17:51,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:17:51,550 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 18:17:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:17:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 18:17:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 18:17:51,552 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-17 18:17:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:17:51,625 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2024-09-17 18:17:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 18:17:51,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 47 [2024-09-17 18:17:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:17:51,628 INFO L225 Difference]: With dead ends: 65 [2024-09-17 18:17:51,628 INFO L226 Difference]: Without dead ends: 63 [2024-09-17 18:17:51,629 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-17 18:17:51,630 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 18:17:51,631 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 80 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 18:17:51,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-17 18:17:51,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-09-17 18:17:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-17 18:17:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-09-17 18:17:51,657 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 47 [2024-09-17 18:17:51,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:17:51,658 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-09-17 18:17:51,658 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-17 18:17:51,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-09-17 18:17:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-17 18:17:51,661 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:17:51,661 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 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, 1] [2024-09-17 18:17:51,661 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-17 18:17:51,661 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:17:51,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash 733242377, now seen corresponding path program 1 times [2024-09-17 18:17:51,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:17:51,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806758042] [2024-09-17 18:17:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:51,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:17:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:17:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-17 18:17:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,761 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-17 18:17:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,771 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 18:17:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,779 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-17 18:17:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 18:17:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,788 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 18:17:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-17 18:17:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-17 18:17:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-17 18:17:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-17 18:17:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-17 18:17:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-17 18:17:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-17 18:17:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-17 18:17:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:17:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806758042] [2024-09-17 18:17:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806758042] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:17:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293579511] [2024-09-17 18:17:51,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:51,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:17:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:17:51,847 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-17 18:17:51,851 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-17 18:17:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:51,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-17 18:17:51,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:17:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 184 proven. 7 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-09-17 18:17:52,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:17:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 34 proven. 7 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-09-17 18:17:52,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293579511] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:17:52,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 18:17:52,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-09-17 18:17:52,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684232066] [2024-09-17 18:17:52,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 18:17:52,182 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:17:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:17:52,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:17:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:17:52,188 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2024-09-17 18:17:52,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:17:52,272 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2024-09-17 18:17:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:17:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) Word has length 81 [2024-09-17 18:17:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:17:52,276 INFO L225 Difference]: With dead ends: 129 [2024-09-17 18:17:52,276 INFO L226 Difference]: Without dead ends: 83 [2024-09-17 18:17:52,277 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:17:52,282 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:17:52,284 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:17:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-17 18:17:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-09-17 18:17:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 41 states have call successors, (41), 8 states have call predecessors, (41), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-17 18:17:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 118 transitions. [2024-09-17 18:17:52,303 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 118 transitions. Word has length 81 [2024-09-17 18:17:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:17:52,304 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 118 transitions. [2024-09-17 18:17:52,305 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) [2024-09-17 18:17:52,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 118 transitions. [2024-09-17 18:17:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-09-17 18:17:52,307 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:17:52,307 INFO L216 NwaCegarLoop]: trace histogram [22, 21, 21, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:17:52,326 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-17 18:17:52,511 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-17 18:17:52,512 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:17:52,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:52,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1779798679, now seen corresponding path program 2 times [2024-09-17 18:17:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:17:52,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486651030] [2024-09-17 18:17:52,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:52,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:17:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:17:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-17 18:17:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-17 18:17:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 18:17:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-17 18:17:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 18:17:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 18:17:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-17 18:17:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-17 18:17:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-17 18:17:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,900 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-17 18:17:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,905 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-17 18:17:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-17 18:17:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-17 18:17:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,918 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-17 18:17:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-17 18:17:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-17 18:17:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-17 18:17:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,938 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-17 18:17:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-17 18:17:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,947 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-17 18:17:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-09-17 18:17:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2024-09-17 18:17:52,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:17:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486651030] [2024-09-17 18:17:52,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486651030] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:17:52,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167371172] [2024-09-17 18:17:52,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-17 18:17:52,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:17:52,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:17:52,961 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-17 18:17:52,962 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-17 18:17:53,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-17 18:17:53,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 18:17:53,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-17 18:17:53,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:17:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 49 proven. 41 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-09-17 18:17:53,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:17:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2024-09-17 18:17:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167371172] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-17 18:17:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-17 18:17:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 13] total 22 [2024-09-17 18:17:53,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691840385] [2024-09-17 18:17:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:17:53,683 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-17 18:17:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:17:53,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-17 18:17:53,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2024-09-17 18:17:53,687 INFO L87 Difference]: Start difference. First operand 83 states and 118 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-17 18:17:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:17:53,787 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-09-17 18:17:53,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:17:53,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 123 [2024-09-17 18:17:53,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:17:53,789 INFO L225 Difference]: With dead ends: 89 [2024-09-17 18:17:53,789 INFO L226 Difference]: Without dead ends: 87 [2024-09-17 18:17:53,790 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 277 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2024-09-17 18:17:53,791 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:17:53,791 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 110 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:17:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-17 18:17:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-09-17 18:17:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 41 states have call successors, (41), 9 states have call predecessors, (41), 8 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-17 18:17:53,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-09-17 18:17:53,816 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 123 [2024-09-17 18:17:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:17:53,817 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-09-17 18:17:53,817 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-17 18:17:53,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:53,818 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2024-09-17 18:17:53,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-09-17 18:17:53,819 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:17:53,819 INFO L216 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:17:53,838 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-17 18:17:54,020 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:17:54,021 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:17:54,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1411465217, now seen corresponding path program 3 times [2024-09-17 18:17:54,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:17:54,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668531767] [2024-09-17 18:17:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:54,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:17:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:17:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-17 18:17:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-17 18:17:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 18:17:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-17 18:17:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,267 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 18:17:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 18:17:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,272 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-17 18:17:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-17 18:17:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,278 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-17 18:17:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-17 18:17:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-17 18:17:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-17 18:17:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-17 18:17:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-17 18:17:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-17 18:17:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-17 18:17:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-17 18:17:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-17 18:17:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-17 18:17:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-17 18:17:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-09-17 18:17:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,334 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-09-17 18:17:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-09-17 18:17:54,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:17:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668531767] [2024-09-17 18:17:54,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668531767] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:17:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939770533] [2024-09-17 18:17:54,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-17 18:17:54,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:17:54,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:17:54,340 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-17 18:17:54,341 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-17 18:17:54,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-17 18:17:54,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 18:17:54,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-17 18:17:54,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:17:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 959 trivial. 0 not checked. [2024-09-17 18:17:54,489 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:17:54,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939770533] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:17:54,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-17 18:17:54,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2024-09-17 18:17:54,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854401748] [2024-09-17 18:17:54,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:17:54,490 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-17 18:17:54,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:17:54,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-17 18:17:54,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-09-17 18:17:54,491 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-17 18:17:54,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:17:54,569 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2024-09-17 18:17:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-17 18:17:54,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 128 [2024-09-17 18:17:54,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:17:54,574 INFO L225 Difference]: With dead ends: 101 [2024-09-17 18:17:54,574 INFO L226 Difference]: Without dead ends: 99 [2024-09-17 18:17:54,575 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-09-17 18:17:54,575 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:17:54,575 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 18:17:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-17 18:17:54,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-09-17 18:17:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 46 states have (on average 1.065217391304348) internal successors, (49), 47 states have internal predecessors, (49), 41 states have call successors, (41), 12 states have call predecessors, (41), 11 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-17 18:17:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 130 transitions. [2024-09-17 18:17:54,597 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 130 transitions. Word has length 128 [2024-09-17 18:17:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:17:54,599 INFO L474 AbstractCegarLoop]: Abstraction has 99 states and 130 transitions. [2024-09-17 18:17:54,599 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-09-17 18:17:54,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 130 transitions. [2024-09-17 18:17:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-09-17 18:17:54,605 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:17:54,605 INFO L216 NwaCegarLoop]: trace histogram [27, 26, 26, 6, 6, 6, 6, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 18:17:54,623 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-17 18:17:54,809 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-17 18:17:54,810 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:17:54,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1811846900, now seen corresponding path program 4 times [2024-09-17 18:17:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:17:54,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654806005] [2024-09-17 18:17:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:17:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:17:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:17:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-17 18:17:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-17 18:17:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 18:17:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-17 18:17:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-17 18:17:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,103 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-17 18:17:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,107 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-17 18:17:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-17 18:17:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-09-17 18:17:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-09-17 18:17:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-17 18:17:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-09-17 18:17:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-17 18:17:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-09-17 18:17:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-17 18:17:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-17 18:17:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,134 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-09-17 18:17:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,137 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-09-17 18:17:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,139 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-09-17 18:17:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,141 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-09-17 18:17:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,145 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-09-17 18:17:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-09-17 18:17:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,150 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-09-17 18:17:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-09-17 18:17:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-09-17 18:17:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-09-17 18:17:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:17:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 56 proven. 70 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2024-09-17 18:17:55,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:17:55,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654806005] [2024-09-17 18:17:55,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654806005] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:17:55,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661422968] [2024-09-17 18:17:55,161 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-17 18:17:55,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:17:55,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:17:55,163 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-17 18:17:55,164 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-17 18:17:55,231 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-17 18:17:55,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 18:17:55,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-17 18:17:55,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:17:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 77 proven. 52 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-09-17 18:17:55,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:17:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1429 backedges. 52 proven. 73 refuted. 0 times theorem prover too weak. 1304 trivial. 0 not checked. [2024-09-17 18:17:55,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661422968] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:17:55,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 18:17:55,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 23 [2024-09-17 18:17:55,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088420557] [2024-09-17 18:17:55,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 18:17:55,665 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-17 18:17:55,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:17:55,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-17 18:17:55,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2024-09-17 18:17:55,666 INFO L87 Difference]: Start difference. First operand 99 states and 130 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 14 states have call successors, (55), 3 states have call predecessors, (55), 1 states have return successors, (51), 14 states have call predecessors, (51), 14 states have call successors, (51) [2024-09-17 18:17:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:17:56,156 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2024-09-17 18:17:56,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-17 18:17:56,157 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 14 states have call successors, (55), 3 states have call predecessors, (55), 1 states have return successors, (51), 14 states have call predecessors, (51), 14 states have call successors, (51) Word has length 149 [2024-09-17 18:17:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:17:56,158 INFO L225 Difference]: With dead ends: 164 [2024-09-17 18:17:56,158 INFO L226 Difference]: Without dead ends: 0 [2024-09-17 18:17:56,161 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 338 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2024-09-17 18:17:56,161 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-17 18:17:56,162 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 182 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-17 18:17:56,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-17 18:17:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-17 18:17:56,162 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-17 18:17:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-17 18:17:56,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 149 [2024-09-17 18:17:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:17:56,163 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-17 18:17:56,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 14 states have call successors, (55), 3 states have call predecessors, (55), 1 states have return successors, (51), 14 states have call predecessors, (51), 14 states have call successors, (51) [2024-09-17 18:17:56,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:17:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-17 18:17:56,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-17 18:17:56,167 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-17 18:17:56,184 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-17 18:17:56,370 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 18:17:56,374 INFO L408 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-09-17 18:17:56,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-17 18:17:57,278 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-17 18:17:57,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.09 06:17:57 BoogieIcfgContainer [2024-09-17 18:17:57,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-17 18:17:57,295 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-17 18:17:57,295 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-17 18:17:57,296 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-17 18:17:57,296 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:17:49" (3/4) ... [2024-09-17 18:17:57,298 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-17 18:17:57,357 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-17 18:17:57,358 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-17 18:17:57,358 INFO L158 Benchmark]: Toolchain (without parser) took 8369.62ms. Allocated memory was 190.8MB in the beginning and 302.0MB in the end (delta: 111.1MB). Free memory was 121.3MB in the beginning and 250.3MB in the end (delta: -129.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 18:17:57,359 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 18:17:57,359 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.38ms. Allocated memory is still 190.8MB. Free memory was 121.1MB in the beginning and 109.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-17 18:17:57,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.85ms. Allocated memory is still 190.8MB. Free memory was 109.9MB in the beginning and 164.2MB in the end (delta: -54.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-09-17 18:17:57,360 INFO L158 Benchmark]: Boogie Preprocessor took 73.72ms. Allocated memory is still 190.8MB. Free memory was 164.2MB in the beginning and 162.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 18:17:57,360 INFO L158 Benchmark]: RCFGBuilder took 350.48ms. Allocated memory is still 190.8MB. Free memory was 162.4MB in the beginning and 150.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-17 18:17:57,361 INFO L158 Benchmark]: TraceAbstraction took 7570.51ms. Allocated memory was 190.8MB in the beginning and 302.0MB in the end (delta: 111.1MB). Free memory was 149.9MB in the beginning and 253.4MB in the end (delta: -103.6MB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. [2024-09-17 18:17:57,361 INFO L158 Benchmark]: Witness Printer took 62.43ms. Allocated memory is still 302.0MB. Free memory was 252.4MB in the beginning and 250.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 18:17:57,363 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 113.2MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.38ms. Allocated memory is still 190.8MB. Free memory was 121.1MB in the beginning and 109.9MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.85ms. Allocated memory is still 190.8MB. Free memory was 109.9MB in the beginning and 164.2MB in the end (delta: -54.3MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.72ms. Allocated memory is still 190.8MB. Free memory was 164.2MB in the beginning and 162.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 350.48ms. Allocated memory is still 190.8MB. Free memory was 162.4MB in the beginning and 150.5MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7570.51ms. Allocated memory was 190.8MB in the beginning and 302.0MB in the end (delta: 111.1MB). Free memory was 149.9MB in the beginning and 253.4MB in the end (delta: -103.6MB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. * Witness Printer took 62.43ms. Allocated memory is still 302.0MB. Free memory was 252.4MB in the beginning and 250.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: 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 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 10, TraceHistogramMax: 27, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 996 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 743 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 635 IncrementalHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 253 mSDtfsCounter, 635 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1145 GetRequests, 1025 SyntacticMatches, 13 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1094 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1430 ConstructedInterpolants, 0 QuantifiedInterpolants, 2406 SizeOfPredicates, 4 NumberOfNonLiveVariables, 794 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 9996/10307 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: 18]: Loop Invariant Derived loop invariant: ((((j == 0) && (0 <= i)) && (i <= 3)) || ((((i <= ((long long) j + 3)) && (1 <= j)) && (j <= i)) && (j <= 4))) - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((i <= 4) && (0 <= i)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-17 18:17:57,391 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