./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 27b49876 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-simple/nested_3.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 --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-27b4987-m [2024-09-21 11:37:40,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 11:37:40,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-21 11:37:40,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 11:37:40,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 11:37:40,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 11:37:40,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 11:37:40,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 11:37:40,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 11:37:40,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 11:37:40,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 11:37:40,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 11:37:40,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 11:37:40,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 11:37:40,471 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 11:37:40,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 11:37:40,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 11:37:40,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 11:37:40,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-21 11:37:40,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 11:37:40,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 11:37:40,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 11:37:40,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 11:37:40,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 11:37:40,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 11:37:40,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 11:37:40,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 11:37:40,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 11:37:40,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 11:37:40,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 11:37:40,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 11:37:40,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 11:37:40,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:37:40,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 11:37:40,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 11:37:40,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 11:37:40,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-21 11:37:40,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-21 11:37:40,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 11:37:40,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 11:37:40,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 11:37:40,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 11:37:40,479 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 -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 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-21 11:37:40,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 11:37:40,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 11:37:40,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 11:37:40,778 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 11:37:40,779 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 11:37:40,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_3.c [2024-09-21 11:37:42,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 11:37:42,302 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 11:37:42,302 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_3.c [2024-09-21 11:37:42,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/64d0672ad/5bcd7e1862174176965d783b6e5f9fa9/FLAG724bf0d17 [2024-09-21 11:37:42,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/64d0672ad/5bcd7e1862174176965d783b6e5f9fa9 [2024-09-21 11:37:42,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 11:37:42,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 11:37:42,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 11:37:42,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 11:37:42,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 11:37:42,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@685ab635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42, skipping insertion in model container [2024-09-21 11:37:42,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 11:37:42,901 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-simple/nested_3.c[784,797] [2024-09-21 11:37:42,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:37:42,913 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 11:37:42,923 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-simple/nested_3.c[784,797] [2024-09-21 11:37:42,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:37:42,938 INFO L204 MainTranslator]: Completed translation [2024-09-21 11:37:42,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42 WrapperNode [2024-09-21 11:37:42,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 11:37:42,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 11:37:42,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 11:37:42,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 11:37:42,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,958 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 11:37:42,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 11:37:42,959 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 11:37:42,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 11:37:42,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 11:37:42,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,977 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-21 11:37:42,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 11:37:42,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 11:37:42,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 11:37:42,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 11:37:42,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (1/1) ... [2024-09-21 11:37:42,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:37:43,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:37:43,025 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-21 11:37:43,028 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-21 11:37:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 11:37:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 11:37:43,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 11:37:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 11:37:43,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 11:37:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 11:37:43,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 11:37:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-21 11:37:43,214 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 11:37:43,216 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 11:37:43,326 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-21 11:37:43,326 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 11:37:43,347 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 11:37:43,348 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-21 11:37:43,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:37:43 BoogieIcfgContainer [2024-09-21 11:37:43,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 11:37:43,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 11:37:43,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 11:37:43,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 11:37:43,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 11:37:42" (1/3) ... [2024-09-21 11:37:43,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61416f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:37:43, skipping insertion in model container [2024-09-21 11:37:43,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:37:42" (2/3) ... [2024-09-21 11:37:43,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61416f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:37:43, skipping insertion in model container [2024-09-21 11:37:43,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:37:43" (3/3) ... [2024-09-21 11:37:43,356 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_3.c [2024-09-21 11:37:43,370 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 11:37:43,370 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 11:37:43,411 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 11:37:43,418 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@eede7c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 11:37:43,418 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 11:37:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 11:37:43,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-21 11:37:43,427 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:37:43,428 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:37:43,428 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:37:43,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1012239947, now seen corresponding path program 1 times [2024-09-21 11:37:43,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:37:43,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680562855] [2024-09-21 11:37:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:43,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:37:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:43,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:37:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:43,560 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-21 11:37:43,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:37:43,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680562855] [2024-09-21 11:37:43,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680562855] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:37:43,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:37:43,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-21 11:37:43,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692542933] [2024-09-21 11:37:43,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:37:43,568 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-21 11:37:43,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:37:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-21 11:37:43,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-21 11:37:43,587 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:37:43,604 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2024-09-21 11:37:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-21 11:37:43,606 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-21 11:37:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:37:43,610 INFO L225 Difference]: With dead ends: 29 [2024-09-21 11:37:43,610 INFO L226 Difference]: Without dead ends: 13 [2024-09-21 11:37:43,612 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-21 11:37:43,615 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:37:43,616 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:37:43,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-21 11:37:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-21 11:37:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-09-21 11:37:43,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2024-09-21 11:37:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:37:43,640 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-09-21 11:37:43,642 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:43,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:43,644 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-09-21 11:37:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-21 11:37:43,644 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:37:43,644 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:37:43,645 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-21 11:37:43,645 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:37:43,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1012211117, now seen corresponding path program 1 times [2024-09-21 11:37:43,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:37:43,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469770372] [2024-09-21 11:37:43,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:43,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:37:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:43,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:37:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:43,723 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-21 11:37:43,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:37:43,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469770372] [2024-09-21 11:37:43,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469770372] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:37:43,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:37:43,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-21 11:37:43,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281611353] [2024-09-21 11:37:43,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:37:43,725 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-21 11:37:43,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:37:43,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-21 11:37:43,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 11:37:43,727 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:37:43,747 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-09-21 11:37:43,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-21 11:37:43,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-21 11:37:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:37:43,748 INFO L225 Difference]: With dead ends: 21 [2024-09-21 11:37:43,749 INFO L226 Difference]: Without dead ends: 18 [2024-09-21 11:37:43,749 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-21 11:37:43,750 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:37:43,751 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:37:43,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-21 11:37:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2024-09-21 11:37:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-09-21 11:37:43,759 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2024-09-21 11:37:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:37:43,760 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-09-21 11:37:43,760 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:43,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:43,761 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-09-21 11:37:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-21 11:37:43,761 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:37:43,761 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:37:43,762 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-21 11:37:43,762 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:37:43,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -150948438, now seen corresponding path program 1 times [2024-09-21 11:37:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:37:43,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463422634] [2024-09-21 11:37:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:37:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:43,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:37:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:43,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:37:43,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:37:43,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463422634] [2024-09-21 11:37:43,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463422634] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:37:43,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:37:43,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-21 11:37:43,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027821376] [2024-09-21 11:37:43,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:37:43,862 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-21 11:37:43,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:37:43,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-21 11:37:43,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 11:37:43,863 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:37:43,901 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-09-21 11:37:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-21 11:37:43,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-21 11:37:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:37:43,903 INFO L225 Difference]: With dead ends: 25 [2024-09-21 11:37:43,904 INFO L226 Difference]: Without dead ends: 17 [2024-09-21 11:37:43,904 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-21 11:37:43,905 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:37:43,908 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:37:43,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-21 11:37:43,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2024-09-21 11:37:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-09-21 11:37:43,917 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-09-21 11:37:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:37:43,917 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-09-21 11:37:43,917 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:43,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-09-21 11:37:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-21 11:37:43,922 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:37:43,922 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:37:43,922 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-21 11:37:43,922 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:37:43,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:43,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2014245097, now seen corresponding path program 1 times [2024-09-21 11:37:43,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:37:43,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368557486] [2024-09-21 11:37:43,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:43,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:37:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:43,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:37:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:44,005 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-21 11:37:44,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:37:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368557486] [2024-09-21 11:37:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368557486] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:37:44,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:37:44,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-21 11:37:44,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683973779] [2024-09-21 11:37:44,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:37:44,007 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-21 11:37:44,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:37:44,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-21 11:37:44,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 11:37:44,009 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:37:44,022 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-09-21 11:37:44,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-21 11:37:44,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-21 11:37:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:37:44,023 INFO L225 Difference]: With dead ends: 25 [2024-09-21 11:37:44,024 INFO L226 Difference]: Without dead ends: 16 [2024-09-21 11:37:44,024 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-21 11:37:44,025 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:37:44,026 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:37:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-21 11:37:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-21 11:37:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:44,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-21 11:37:44,030 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2024-09-21 11:37:44,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:37:44,030 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-21 11:37:44,031 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:44,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-21 11:37:44,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-21 11:37:44,032 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:37:44,032 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:37:44,032 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-21 11:37:44,032 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:37:44,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1860063267, now seen corresponding path program 1 times [2024-09-21 11:37:44,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:37:44,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25411417] [2024-09-21 11:37:44,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:44,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:37:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:44,107 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:37:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:37:44,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:37:44,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25411417] [2024-09-21 11:37:44,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25411417] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:37:44,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124214915] [2024-09-21 11:37:44,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:44,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:37:44,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:37:44,125 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-21 11:37:44,127 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-21 11:37:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:44,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-21 11:37:44,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:37:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:37:44,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:37:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:37:44,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124214915] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:37:44,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:37:44,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-21 11:37:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173619829] [2024-09-21 11:37:44,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:37:44,264 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-21 11:37:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:37:44,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-21 11:37:44,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:37:44,269 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:37:44,298 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-09-21 11:37:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 11:37:44,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-21 11:37:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:37:44,299 INFO L225 Difference]: With dead ends: 29 [2024-09-21 11:37:44,299 INFO L226 Difference]: Without dead ends: 19 [2024-09-21 11:37:44,300 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:37:44,302 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:37:44,303 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:37:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-21 11:37:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-21 11:37:44,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-09-21 11:37:44,312 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2024-09-21 11:37:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:37:44,312 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-09-21 11:37:44,312 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:44,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-09-21 11:37:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-21 11:37:44,315 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:37:44,315 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:37:44,333 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-21 11:37:44,516 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:37:44,516 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:37:44,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:44,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2042556951, now seen corresponding path program 2 times [2024-09-21 11:37:44,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:37:44,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141207134] [2024-09-21 11:37:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:37:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:44,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:37:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-21 11:37:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:37:44,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141207134] [2024-09-21 11:37:44,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141207134] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:37:44,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582184871] [2024-09-21 11:37:44,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-21 11:37:44,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:37:44,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:37:44,624 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-21 11:37:44,626 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-21 11:37:44,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-21 11:37:44,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:37:44,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-21 11:37:44,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:37:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:37:44,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:37:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:37:44,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582184871] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:37:44,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:37:44,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-21 11:37:44,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672492032] [2024-09-21 11:37:44,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:37:44,814 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-21 11:37:44,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:37:44,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-21 11:37:44,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-21 11:37:44,815 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:37:44,983 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-09-21 11:37:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-21 11:37:44,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-21 11:37:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:37:44,984 INFO L225 Difference]: With dead ends: 51 [2024-09-21 11:37:44,984 INFO L226 Difference]: Without dead ends: 38 [2024-09-21 11:37:44,986 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-21 11:37:44,987 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:37:44,989 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:37:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-21 11:37:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-09-21 11:37:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-21 11:37:44,999 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2024-09-21 11:37:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:37:45,000 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-21 11:37:45,000 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:45,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:45,001 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-21 11:37:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-21 11:37:45,002 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:37:45,002 INFO L216 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:37:45,018 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-21 11:37:45,202 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-21 11:37:45,203 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:37:45,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:45,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1056908150, now seen corresponding path program 3 times [2024-09-21 11:37:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:37:45,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147638032] [2024-09-21 11:37:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:37:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:45,265 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:37:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-21 11:37:45,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:37:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147638032] [2024-09-21 11:37:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147638032] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:37:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256758911] [2024-09-21 11:37:45,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-21 11:37:45,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:37:45,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:37:45,277 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-21 11:37:45,279 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-21 11:37:45,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-21 11:37:45,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:37:45,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-21 11:37:45,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:37:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-21 11:37:45,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:37:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-21 11:37:45,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256758911] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:37:45,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:37:45,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-21 11:37:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2237000] [2024-09-21 11:37:45,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:37:45,405 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-21 11:37:45,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:37:45,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-21 11:37:45,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:37:45,406 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:45,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:37:45,454 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-09-21 11:37:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 11:37:45,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-09-21 11:37:45,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:37:45,455 INFO L225 Difference]: With dead ends: 96 [2024-09-21 11:37:45,456 INFO L226 Difference]: Without dead ends: 93 [2024-09-21 11:37:45,456 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:37:45,456 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:37:45,457 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:37:45,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-21 11:37:45,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-09-21 11:37:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.146067415730337) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2024-09-21 11:37:45,483 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 29 [2024-09-21 11:37:45,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:37:45,484 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-09-21 11:37:45,484 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:45,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2024-09-21 11:37:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-09-21 11:37:45,489 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:37:45,489 INFO L216 NwaCegarLoop]: trace histogram [48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:37:45,505 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-21 11:37:45,690 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-21 11:37:45,690 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:37:45,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:45,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1817816557, now seen corresponding path program 4 times [2024-09-21 11:37:45,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:37:45,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276922107] [2024-09-21 11:37:45,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:45,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:37:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:45,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:37:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-09-21 11:37:45,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:37:45,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276922107] [2024-09-21 11:37:45,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276922107] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:37:45,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782918274] [2024-09-21 11:37:45,862 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-21 11:37:45,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:37:45,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:37:45,864 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-21 11:37:45,867 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-21 11:37:45,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-21 11:37:45,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:37:45,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-21 11:37:45,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:37:46,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-09-21 11:37:46,017 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:37:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-09-21 11:37:46,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782918274] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:37:46,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:37:46,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-21 11:37:46,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249079759] [2024-09-21 11:37:46,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:37:46,081 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-21 11:37:46,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:37:46,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-21 11:37:46,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-21 11:37:46,082 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:46,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:37:46,153 INFO L93 Difference]: Finished difference Result 305 states and 358 transitions. [2024-09-21 11:37:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-21 11:37:46,154 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-09-21 11:37:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:37:46,157 INFO L225 Difference]: With dead ends: 305 [2024-09-21 11:37:46,160 INFO L226 Difference]: Without dead ends: 237 [2024-09-21 11:37:46,160 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-21 11:37:46,161 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:37:46,162 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:37:46,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-09-21 11:37:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-09-21 11:37:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.1244635193133048) internal successors, (262), 233 states have internal predecessors, (262), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2024-09-21 11:37:46,212 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 92 [2024-09-21 11:37:46,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:37:46,212 INFO L474 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2024-09-21 11:37:46,212 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:46,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:46,212 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2024-09-21 11:37:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-09-21 11:37:46,224 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:37:46,224 INFO L216 NwaCegarLoop]: trace histogram [144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:37:46,238 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-21 11:37:46,428 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:37:46,428 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:37:46,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2114622189, now seen corresponding path program 5 times [2024-09-21 11:37:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:37:46,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139638112] [2024-09-21 11:37:46,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:37:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:46,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:37:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-09-21 11:37:46,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:37:46,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139638112] [2024-09-21 11:37:46,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139638112] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:37:46,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061544875] [2024-09-21 11:37:46,885 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-21 11:37:46,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:37:46,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:37:46,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 11:37:46,888 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-21 11:37:47,082 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2024-09-21 11:37:47,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:37:47,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-21 11:37:47,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:37:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-09-21 11:37:47,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:37:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-09-21 11:37:47,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061544875] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:37:47,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:37:47,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-09-21 11:37:47,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727525713] [2024-09-21 11:37:47,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:37:47,749 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-21 11:37:47,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:37:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-21 11:37:47,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-21 11:37:47,751 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:37:47,827 INFO L93 Difference]: Finished difference Result 354 states and 397 transitions. [2024-09-21 11:37:47,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-21 11:37:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 236 [2024-09-21 11:37:47,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:37:47,830 INFO L225 Difference]: With dead ends: 354 [2024-09-21 11:37:47,830 INFO L226 Difference]: Without dead ends: 351 [2024-09-21 11:37:47,831 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 469 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-21 11:37:47,831 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:37:47,831 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:37:47,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-09-21 11:37:47,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-09-21 11:37:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 347 states have (on average 1.1239193083573487) internal successors, (390), 347 states have internal predecessors, (390), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 393 transitions. [2024-09-21 11:37:47,879 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 393 transitions. Word has length 236 [2024-09-21 11:37:47,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:37:47,881 INFO L474 AbstractCegarLoop]: Abstraction has 351 states and 393 transitions. [2024-09-21 11:37:47,881 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:47,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 393 transitions. [2024-09-21 11:37:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-09-21 11:37:47,892 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:37:47,892 INFO L216 NwaCegarLoop]: trace histogram [216, 36, 36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:37:47,910 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-21 11:37:48,093 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:37:48,093 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:37:48,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1900573069, now seen corresponding path program 6 times [2024-09-21 11:37:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:37:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45165722] [2024-09-21 11:37:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:37:48,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:37:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:49,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:37:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:37:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 0 proven. 28563 refuted. 0 times theorem prover too weak. 4590 trivial. 0 not checked. [2024-09-21 11:37:49,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:37:49,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45165722] [2024-09-21 11:37:49,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45165722] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:37:49,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602705411] [2024-09-21 11:37:49,617 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-21 11:37:49,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:37:49,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:37:49,619 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 11:37:49,620 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-21 11:37:49,789 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 59 check-sat command(s) [2024-09-21 11:37:49,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:37:49,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-21 11:37:49,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:37:50,040 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 9512 proven. 21 refuted. 0 times theorem prover too weak. 23620 trivial. 0 not checked. [2024-09-21 11:37:50,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:37:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 9256 proven. 277 refuted. 0 times theorem prover too weak. 23620 trivial. 0 not checked. [2024-09-21 11:37:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602705411] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:37:50,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:37:50,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 41 [2024-09-21 11:37:50,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792437408] [2024-09-21 11:37:50,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:37:50,690 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-21 11:37:50,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:37:50,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-21 11:37:50,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1303, Unknown=0, NotChecked=0, Total=1640 [2024-09-21 11:37:50,692 INFO L87 Difference]: Start difference. First operand 351 states and 393 transitions. Second operand has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 41 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:37:55,309 INFO L93 Difference]: Finished difference Result 687 states and 772 transitions. [2024-09-21 11:37:55,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2024-09-21 11:37:55,310 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 41 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 350 [2024-09-21 11:37:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:37:55,313 INFO L225 Difference]: With dead ends: 687 [2024-09-21 11:37:55,313 INFO L226 Difference]: Without dead ends: 0 [2024-09-21 11:37:55,339 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 686 SyntacticMatches, 2 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34264 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=9112, Invalid=78208, Unknown=0, NotChecked=0, Total=87320 [2024-09-21 11:37:55,340 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-21 11:37:55,340 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-21 11:37:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-21 11:37:55,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-21 11:37:55,341 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-21 11:37:55,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-21 11:37:55,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 350 [2024-09-21 11:37:55,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:37:55,342 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-21 11:37:55,343 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 41 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:37:55,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:37:55,343 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-21 11:37:55,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-21 11:37:55,346 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-21 11:37:55,363 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-21 11:37:55,546 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-21 11:37:55,550 INFO L408 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2024-09-21 11:37:55,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-21 11:37:59,537 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-21 11:37:59,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 11:37:59 BoogieIcfgContainer [2024-09-21 11:37:59,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-21 11:37:59,551 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-21 11:37:59,551 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-21 11:37:59,551 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-21 11:37:59,552 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:37:43" (3/4) ... [2024-09-21 11:37:59,553 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-21 11:37:59,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-21 11:37:59,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-21 11:37:59,594 INFO L158 Benchmark]: Toolchain (without parser) took 16873.50ms. Allocated memory was 148.9MB in the beginning and 453.0MB in the end (delta: 304.1MB). Free memory was 97.0MB in the beginning and 347.2MB in the end (delta: -250.2MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-09-21 11:37:59,594 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 58.7MB in the beginning and 58.6MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:37:59,594 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.00ms. Allocated memory is still 148.9MB. Free memory was 96.4MB in the beginning and 85.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-21 11:37:59,594 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.38ms. Allocated memory is still 148.9MB. Free memory was 85.4MB in the beginning and 84.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 11:37:59,594 INFO L158 Benchmark]: Boogie Preprocessor took 26.14ms. Allocated memory is still 148.9MB. Free memory was 84.4MB in the beginning and 82.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 11:37:59,595 INFO L158 Benchmark]: RCFGBuilder took 362.58ms. Allocated memory is still 148.9MB. Free memory was 82.8MB in the beginning and 112.5MB in the end (delta: -29.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-21 11:37:59,595 INFO L158 Benchmark]: TraceAbstraction took 16200.67ms. Allocated memory was 148.9MB in the beginning and 453.0MB in the end (delta: 304.1MB). Free memory was 111.6MB in the beginning and 349.2MB in the end (delta: -237.5MB). Peak memory consumption was 269.9MB. Max. memory is 16.1GB. [2024-09-21 11:37:59,595 INFO L158 Benchmark]: Witness Printer took 41.96ms. Allocated memory is still 453.0MB. Free memory was 349.2MB in the beginning and 347.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 11:37:59,597 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.16ms. Allocated memory is still 96.5MB. Free memory was 58.7MB in the beginning and 58.6MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 216.00ms. Allocated memory is still 148.9MB. Free memory was 96.4MB in the beginning and 85.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.38ms. Allocated memory is still 148.9MB. Free memory was 85.4MB in the beginning and 84.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.14ms. Allocated memory is still 148.9MB. Free memory was 84.4MB in the beginning and 82.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.58ms. Allocated memory is still 148.9MB. Free memory was 82.8MB in the beginning and 112.5MB in the end (delta: -29.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 16200.67ms. Allocated memory was 148.9MB in the beginning and 453.0MB in the end (delta: 304.1MB). Free memory was 111.6MB in the beginning and 349.2MB in the end (delta: -237.5MB). Peak memory consumption was 269.9MB. Max. memory is 16.1GB. * Witness Printer took 41.96ms. Allocated memory is still 453.0MB. Free memory was 349.2MB in the beginning and 347.2MB in the end (delta: 2.0MB). 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: 29]: 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 3 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 10, TraceHistogramMax: 216, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 474 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 112 mSDtfsCounter, 474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 1474 SyntacticMatches, 10 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34391 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=9, InterpolantAutomatonStates: 329, 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, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 2239 ConstructedInterpolants, 0 QuantifiedInterpolants, 5413 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1580 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 86462/148839 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: 22]: Loop Invariant Derived loop invariant: (((c == 6) && (b <= 6)) && (a <= 5)) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((b == 6) && (c == 6)) && (a <= 6)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((b <= 5) && (a <= 5)) && (c == 1)) || (((b <= 5) && (5 == c)) && (a <= 5))) || (((c == 6) && (b <= 5)) && (a <= 5))) || (((b <= 5) && (a <= 5)) && (c == 3))) || (((b <= 5) && (c == 0)) && (a <= 5))) || (((b <= 5) && (c == 2)) && (a <= 5))) || (((b <= 5) && (c == 4)) && (a <= 5))) RESULT: Ultimate proved your program to be correct! [2024-09-21 11:37:59,622 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE