./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_5.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 f1d7dc9d 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_5.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 3d0f32d2f39934bb8fd732fa206acfa5d2fb4cacaee37919c0e4326d55891c86 --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-f1d7dc9-m [2024-09-20 12:15:48,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:15:48,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:15:48,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:15:48,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:15:48,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:15:48,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:15:48,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:15:48,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:15:48,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:15:48,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:15:48,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:15:48,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:15:48,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:15:48,422 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:15:48,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:15:48,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:15:48,423 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:15:48,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:15:48,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:15:48,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:15:48,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:15:48,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:15:48,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:15:48,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:15:48,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:15:48,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:15:48,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:15:48,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:15:48,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:15:48,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:15:48,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:15:48,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:15:48,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:15:48,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:15:48,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:15:48,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:15:48,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:15:48,431 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:15:48,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:15:48,432 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:15:48,432 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:15:48,432 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 -> 3d0f32d2f39934bb8fd732fa206acfa5d2fb4cacaee37919c0e4326d55891c86 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-20 12:15:48,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 12:15:48,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 12:15:48,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 12:15:48,726 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 12:15:48,726 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 12:15:48,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_5.c [2024-09-20 12:15:50,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 12:15:50,389 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 12:15:50,390 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_5.c [2024-09-20 12:15:50,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5d4619d96/0b922ef97c854463a27e287bfd5f93cb/FLAGb44ef095b [2024-09-20 12:15:50,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5d4619d96/0b922ef97c854463a27e287bfd5f93cb [2024-09-20 12:15:50,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 12:15:50,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 12:15:50,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 12:15:50,418 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 12:15:50,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 12:15:50,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e8f122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50, skipping insertion in model container [2024-09-20 12:15:50,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 12:15:50,616 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_5.c[899,912] [2024-09-20 12:15:50,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:15:50,632 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 12:15:50,647 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_5.c[899,912] [2024-09-20 12:15:50,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 12:15:50,674 INFO L204 MainTranslator]: Completed translation [2024-09-20 12:15:50,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50 WrapperNode [2024-09-20 12:15:50,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 12:15:50,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 12:15:50,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 12:15:50,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 12:15:50,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,693 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,712 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 12:15:50,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 12:15:50,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 12:15:50,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 12:15:50,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 12:15:50,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,751 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-20 12:15:50,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 12:15:50,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 12:15:50,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 12:15:50,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 12:15:50,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (1/1) ... [2024-09-20 12:15:50,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:15:50,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:50,802 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-20 12:15:50,809 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-20 12:15:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 12:15:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 12:15:50,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 12:15:50,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 12:15:50,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 12:15:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 12:15:50,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 12:15:50,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 12:15:50,927 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 12:15:50,930 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 12:15:51,095 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-20 12:15:51,097 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 12:15:51,126 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 12:15:51,126 INFO L318 CfgBuilder]: Removed 5 assume(true) statements. [2024-09-20 12:15:51,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:15:51 BoogieIcfgContainer [2024-09-20 12:15:51,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 12:15:51,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 12:15:51,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 12:15:51,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 12:15:51,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:15:50" (1/3) ... [2024-09-20 12:15:51,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da95df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:15:51, skipping insertion in model container [2024-09-20 12:15:51,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:15:50" (2/3) ... [2024-09-20 12:15:51,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da95df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:15:51, skipping insertion in model container [2024-09-20 12:15:51,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:15:51" (3/3) ... [2024-09-20 12:15:51,137 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_5.c [2024-09-20 12:15:51,154 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 12:15:51,154 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 12:15:51,222 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 12:15:51,230 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;@4e56adf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 12:15:51,231 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 12:15:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 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-20 12:15:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-20 12:15:51,245 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:51,245 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:51,246 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:51,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash 424554851, now seen corresponding path program 1 times [2024-09-20 12:15:51,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:51,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709765143] [2024-09-20 12:15:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:51,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:51,405 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-20 12:15:51,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:51,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709765143] [2024-09-20 12:15:51,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709765143] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:51,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:51,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 12:15:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207212410] [2024-09-20 12:15:51,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:51,417 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 12:15:51,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:51,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 12:15:51,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 12:15:51,446 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.8) internal successors, (27), 16 states have internal predecessors, (27), 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-20 12:15:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:51,474 INFO L93 Difference]: Finished difference Result 37 states and 57 transitions. [2024-09-20 12:15:51,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 12:15:51,477 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-20 12:15:51,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:51,483 INFO L225 Difference]: With dead ends: 37 [2024-09-20 12:15:51,484 INFO L226 Difference]: Without dead ends: 17 [2024-09-20 12:15:51,487 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-20 12:15:51,491 INFO L434 NwaCegarLoop]: 22 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, 22 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-20 12:15:51,492 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:15:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-20 12:15:51,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-20 12:15:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 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-20 12:15:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-09-20 12:15:51,523 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 8 [2024-09-20 12:15:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:51,524 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-09-20 12:15:51,524 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-20 12:15:51,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-09-20 12:15:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-20 12:15:51,525 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:51,526 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:51,526 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 12:15:51,526 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:51,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:51,527 INFO L85 PathProgramCache]: Analyzing trace with hash 424502957, now seen corresponding path program 1 times [2024-09-20 12:15:51,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:51,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314554440] [2024-09-20 12:15:51,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:51,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:51,602 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-20 12:15:51,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:51,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314554440] [2024-09-20 12:15:51,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314554440] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:51,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:51,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:51,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919669175] [2024-09-20 12:15:51,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:51,604 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:51,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:51,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:51,606 INFO L87 Difference]: Start difference. First operand 17 states and 21 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-20 12:15:51,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:51,634 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-09-20 12:15:51,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:51,634 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-20 12:15:51,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:51,635 INFO L225 Difference]: With dead ends: 29 [2024-09-20 12:15:51,635 INFO L226 Difference]: Without dead ends: 26 [2024-09-20 12:15:51,636 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-20 12:15:51,637 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 31 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-20 12:15:51,638 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 31 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:15:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-20 12:15:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2024-09-20 12:15:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 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-20 12:15:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-09-20 12:15:51,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2024-09-20 12:15:51,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:51,647 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-09-20 12:15:51,647 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-20 12:15:51,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-09-20 12:15:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-20 12:15:51,649 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:51,649 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:51,649 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 12:15:51,649 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:51,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:51,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1994759058, now seen corresponding path program 1 times [2024-09-20 12:15:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:51,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044154934] [2024-09-20 12:15:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:51,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:51,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:51,746 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-20 12:15:51,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044154934] [2024-09-20 12:15:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044154934] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:51,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:51,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:51,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471402682] [2024-09-20 12:15:51,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:51,748 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:51,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:51,749 INFO L87 Difference]: Start difference. First operand 18 states and 22 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-20 12:15:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:51,785 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-09-20 12:15:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:51,788 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-20 12:15:51,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:51,789 INFO L225 Difference]: With dead ends: 37 [2024-09-20 12:15:51,789 INFO L226 Difference]: Without dead ends: 25 [2024-09-20 12:15:51,789 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-20 12:15:51,791 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 30 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-20 12:15:51,793 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:15:51,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-20 12:15:51,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2024-09-20 12:15:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 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-20 12:15:51,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-09-20 12:15:51,801 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2024-09-20 12:15:51,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:51,801 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-09-20 12:15:51,801 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-20 12:15:51,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:51,806 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-09-20 12:15:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-20 12:15:51,807 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:51,809 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:51,810 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 12:15:51,810 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:51,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash -667291207, now seen corresponding path program 1 times [2024-09-20 12:15:51,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:51,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41346034] [2024-09-20 12:15:51,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:51,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:51,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:51,914 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-20 12:15:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:51,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41346034] [2024-09-20 12:15:51,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41346034] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:51,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:51,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302947427] [2024-09-20 12:15:51,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:51,918 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:51,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:51,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:51,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:51,920 INFO L87 Difference]: Start difference. First operand 19 states and 23 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-20 12:15:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:51,956 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2024-09-20 12:15:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:51,957 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-20 12:15:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:51,959 INFO L225 Difference]: With dead ends: 37 [2024-09-20 12:15:51,959 INFO L226 Difference]: Without dead ends: 24 [2024-09-20 12:15:51,960 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-20 12:15:51,962 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 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-20 12:15:51,966 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:15:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-20 12:15:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2024-09-20 12:15:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-20 12:15:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-09-20 12:15:51,975 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2024-09-20 12:15:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:51,976 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-09-20 12:15:51,976 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-20 12:15:51,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-09-20 12:15:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-20 12:15:51,977 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:51,977 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:51,977 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 12:15:51,977 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:51,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash -73398794, now seen corresponding path program 1 times [2024-09-20 12:15:51,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:51,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781273609] [2024-09-20 12:15:51,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:51,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:52,036 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:52,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:52,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781273609] [2024-09-20 12:15:52,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781273609] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:52,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:52,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:52,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668443554] [2024-09-20 12:15:52,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:52,054 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:52,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:52,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:52,058 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-20 12:15:52,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:52,080 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-09-20 12:15:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:52,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2024-09-20 12:15:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:52,081 INFO L225 Difference]: With dead ends: 37 [2024-09-20 12:15:52,081 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 12:15:52,082 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-20 12:15:52,083 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 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-20 12:15:52,083 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:15:52,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 12:15:52,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-09-20 12:15:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-20 12:15:52,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-20 12:15:52,102 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 17 [2024-09-20 12:15:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:52,103 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-20 12:15:52,103 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-20 12:15:52,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-20 12:15:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-20 12:15:52,106 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:52,106 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:52,107 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 12:15:52,107 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:52,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:52,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1923600117, now seen corresponding path program 1 times [2024-09-20 12:15:52,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:52,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558874099] [2024-09-20 12:15:52,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:52,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:52,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:52,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:52,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558874099] [2024-09-20 12:15:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558874099] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 12:15:52,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 12:15:52,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 12:15:52,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226272743] [2024-09-20 12:15:52,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 12:15:52,219 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 12:15:52,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 12:15:52,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 12:15:52,220 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-20 12:15:52,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:52,237 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-09-20 12:15:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 12:15:52,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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 20 [2024-09-20 12:15:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:52,239 INFO L225 Difference]: With dead ends: 37 [2024-09-20 12:15:52,240 INFO L226 Difference]: Without dead ends: 22 [2024-09-20 12:15:52,240 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-20 12:15:52,241 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 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-20 12:15:52,241 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:15:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-20 12:15:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-20 12:15:52,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-20 12:15:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-09-20 12:15:52,251 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20 [2024-09-20 12:15:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:52,251 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-09-20 12:15:52,252 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-20 12:15:52,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-09-20 12:15:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-20 12:15:52,254 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:52,255 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:52,255 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-20 12:15:52,255 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:52,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:52,255 INFO L85 PathProgramCache]: Analyzing trace with hash 406923681, now seen corresponding path program 1 times [2024-09-20 12:15:52,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:52,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304141843] [2024-09-20 12:15:52,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:52,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:52,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:52,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:52,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304141843] [2024-09-20 12:15:52,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304141843] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:15:52,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509641092] [2024-09-20 12:15:52,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:52,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:52,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:52,324 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-20 12:15:52,325 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-20 12:15:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:52,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-20 12:15:52,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:15:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:52,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:15:52,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:52,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509641092] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:15:52,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:15:52,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-20 12:15:52,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370336064] [2024-09-20 12:15:52,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:15:52,446 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 12:15:52,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:52,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 12:15:52,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-20 12:15:52,447 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-20 12:15:52,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:52,481 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-09-20 12:15:52,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 12:15:52,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 21 [2024-09-20 12:15:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:52,484 INFO L225 Difference]: With dead ends: 41 [2024-09-20 12:15:52,484 INFO L226 Difference]: Without dead ends: 25 [2024-09-20 12:15:52,485 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 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-20 12:15:52,486 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:15:52,486 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:15:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-20 12:15:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-20 12:15:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-20 12:15:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-20 12:15:52,496 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 21 [2024-09-20 12:15:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:52,496 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-20 12:15:52,497 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-20 12:15:52,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-20 12:15:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-20 12:15:52,498 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:52,498 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:52,518 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-20 12:15:52,698 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-20 12:15:52,699 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:52,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1149298187, now seen corresponding path program 2 times [2024-09-20 12:15:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:52,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041077671] [2024-09-20 12:15:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:52,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-20 12:15:52,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:52,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041077671] [2024-09-20 12:15:52,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041077671] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:15:52,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131108770] [2024-09-20 12:15:52,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 12:15:52,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:52,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:52,751 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-20 12:15:52,754 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-20 12:15:52,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 12:15:52,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:15:52,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 12:15:52,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:15:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:52,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:15:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 12:15:52,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131108770] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:15:52,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:15:52,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-20 12:15:52,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354326282] [2024-09-20 12:15:52,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:15:52,937 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 12:15:52,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:52,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 12:15:52,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-20 12:15:52,940 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-20 12:15:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:53,112 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2024-09-20 12:15:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-20 12:15:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 24 [2024-09-20 12:15:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:53,116 INFO L225 Difference]: With dead ends: 63 [2024-09-20 12:15:53,116 INFO L226 Difference]: Without dead ends: 44 [2024-09-20 12:15:53,117 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 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-20 12:15:53,119 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:15:53,120 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:15:53,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-20 12:15:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2024-09-20 12:15:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 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-20 12:15:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-09-20 12:15:53,131 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2024-09-20 12:15:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:53,131 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-09-20 12:15:53,131 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-20 12:15:53,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-09-20 12:15:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-20 12:15:53,133 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:53,133 INFO L216 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:53,146 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 12:15:53,334 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:53,334 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:53,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1491254058, now seen corresponding path program 3 times [2024-09-20 12:15:53,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:53,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9925505] [2024-09-20 12:15:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,426 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-20 12:15:53,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9925505] [2024-09-20 12:15:53,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9925505] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:15:53,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024528195] [2024-09-20 12:15:53,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 12:15:53,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:53,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:53,436 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-20 12:15:53,439 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-20 12:15:53,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-20 12:15:53,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:15:53,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-20 12:15:53,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:15:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-09-20 12:15:53,553 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:15:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-09-20 12:15:53,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024528195] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:15:53,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:15:53,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-09-20 12:15:53,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932472666] [2024-09-20 12:15:53,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:15:53,623 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 12:15:53,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:53,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 12:15:53,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-20 12:15:53,624 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-20 12:15:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:53,804 INFO L93 Difference]: Finished difference Result 311 states and 367 transitions. [2024-09-20 12:15:53,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 12:15:53,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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 35 [2024-09-20 12:15:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:53,807 INFO L225 Difference]: With dead ends: 311 [2024-09-20 12:15:53,808 INFO L226 Difference]: Without dead ends: 281 [2024-09-20 12:15:53,812 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-09-20 12:15:53,812 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 76 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:15:53,813 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:15:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-09-20 12:15:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 201. [2024-09-20 12:15:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 197 states have (on average 1.16751269035533) internal successors, (230), 197 states have internal predecessors, (230), 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-20 12:15:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 233 transitions. [2024-09-20 12:15:53,871 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 233 transitions. Word has length 35 [2024-09-20 12:15:53,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:53,871 INFO L474 AbstractCegarLoop]: Abstraction has 201 states and 233 transitions. [2024-09-20 12:15:53,871 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-20 12:15:53,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 233 transitions. [2024-09-20 12:15:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-09-20 12:15:53,876 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:53,876 INFO L216 NwaCegarLoop]: trace histogram [96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:53,895 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-20 12:15:54,077 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-20 12:15:54,077 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:54,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:54,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1947569315, now seen corresponding path program 4 times [2024-09-20 12:15:54,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:54,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334450640] [2024-09-20 12:15:54,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:54,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:54,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6756 backedges. 2566 proven. 1 refuted. 0 times theorem prover too weak. 4189 trivial. 0 not checked. [2024-09-20 12:15:54,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:54,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334450640] [2024-09-20 12:15:54,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334450640] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:15:54,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553277070] [2024-09-20 12:15:54,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 12:15:54,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:54,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:54,319 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-20 12:15:54,321 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-20 12:15:54,448 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 12:15:54,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:15:54,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:15:54,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:15:54,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6756 backedges. 1485 proven. 53 refuted. 0 times theorem prover too weak. 5218 trivial. 0 not checked. [2024-09-20 12:15:54,513 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:15:54,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6756 backedges. 1485 proven. 53 refuted. 0 times theorem prover too weak. 5218 trivial. 0 not checked. [2024-09-20 12:15:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553277070] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:15:54,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:15:54,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-09-20 12:15:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759013008] [2024-09-20 12:15:54,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:15:54,586 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 12:15:54,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:54,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 12:15:54,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-20 12:15:54,587 INFO L87 Difference]: Start difference. First operand 201 states and 233 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-20 12:15:54,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:54,992 INFO L93 Difference]: Finished difference Result 1615 states and 1931 transitions. [2024-09-20 12:15:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-20 12:15:54,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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 200 [2024-09-20 12:15:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:55,010 INFO L225 Difference]: With dead ends: 1615 [2024-09-20 12:15:55,010 INFO L226 Difference]: Without dead ends: 1421 [2024-09-20 12:15:55,015 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-20 12:15:55,016 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 12:15:55,016 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 52 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 12:15:55,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2024-09-20 12:15:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 957. [2024-09-20 12:15:55,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 953 states have (on average 1.131164742917104) internal successors, (1078), 953 states have internal predecessors, (1078), 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-20 12:15:55,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1081 transitions. [2024-09-20 12:15:55,226 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1081 transitions. Word has length 200 [2024-09-20 12:15:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:55,228 INFO L474 AbstractCegarLoop]: Abstraction has 957 states and 1081 transitions. [2024-09-20 12:15:55,228 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-20 12:15:55,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:55,229 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1081 transitions. [2024-09-20 12:15:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 957 [2024-09-20 12:15:55,257 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:55,258 INFO L216 NwaCegarLoop]: trace histogram [576, 96, 96, 96, 16, 16, 16, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:55,278 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 12:15:55,462 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:55,463 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:55,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:55,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1117550867, now seen corresponding path program 5 times [2024-09-20 12:15:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:55,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528481174] [2024-09-20 12:15:55,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:55,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:56,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:15:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:15:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 236738 backedges. 51878 proven. 1853 refuted. 0 times theorem prover too weak. 183007 trivial. 0 not checked. [2024-09-20 12:15:56,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:15:56,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528481174] [2024-09-20 12:15:56,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528481174] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:15:56,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444049183] [2024-09-20 12:15:56,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-20 12:15:56,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:15:56,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:15:56,670 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-20 12:15:56,671 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-20 12:15:56,941 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2024-09-20 12:15:56,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:15:56,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:15:56,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:15:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 236738 backedges. 126006 proven. 1853 refuted. 0 times theorem prover too weak. 108879 trivial. 0 not checked. [2024-09-20 12:15:57,131 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:15:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 236738 backedges. 126006 proven. 1853 refuted. 0 times theorem prover too weak. 108879 trivial. 0 not checked. [2024-09-20 12:15:57,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444049183] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:15:57,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:15:57,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-20 12:15:57,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334370028] [2024-09-20 12:15:57,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:15:57,338 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 12:15:57,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:15:57,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 12:15:57,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:15:57,339 INFO L87 Difference]: Start difference. First operand 957 states and 1081 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-20 12:15:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:15:57,794 INFO L93 Difference]: Finished difference Result 3616 states and 4105 transitions. [2024-09-20 12:15:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 12:15:57,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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 956 [2024-09-20 12:15:57,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:15:57,810 INFO L225 Difference]: With dead ends: 3616 [2024-09-20 12:15:57,811 INFO L226 Difference]: Without dead ends: 2781 [2024-09-20 12:15:57,814 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1918 GetRequests, 1911 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-20 12:15:57,815 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:15:57,815 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:15:57,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2024-09-20 12:15:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 2781. [2024-09-20 12:15:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2777 states have (on average 1.1256751890529348) internal successors, (3126), 2777 states have internal predecessors, (3126), 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-20 12:15:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3129 transitions. [2024-09-20 12:15:58,127 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3129 transitions. Word has length 956 [2024-09-20 12:15:58,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:15:58,128 INFO L474 AbstractCegarLoop]: Abstraction has 2781 states and 3129 transitions. [2024-09-20 12:15:58,128 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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-20 12:15:58,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3129 transitions. [2024-09-20 12:15:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2781 [2024-09-20 12:15:58,226 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:15:58,226 INFO L216 NwaCegarLoop]: trace histogram [1728, 288, 288, 288, 48, 48, 48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:15:58,240 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-20 12:15:58,427 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-20 12:15:58,427 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:15:58,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:15:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1702199533, now seen corresponding path program 6 times [2024-09-20 12:15:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:15:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715003940] [2024-09-20 12:15:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:15:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:15:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:16:03,635 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:16:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:16:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2131506 backedges. 799831 proven. 66653 refuted. 0 times theorem prover too weak. 1265022 trivial. 0 not checked. [2024-09-20 12:16:03,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:16:03,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715003940] [2024-09-20 12:16:03,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715003940] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:16:03,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414766993] [2024-09-20 12:16:03,723 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-20 12:16:03,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:16:03,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:16:03,726 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-20 12:16:03,728 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-20 12:16:06,930 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 465 check-sat command(s) [2024-09-20 12:16:06,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 12:16:06,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 5411 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-20 12:16:06,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:16:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2131506 backedges. 799834 proven. 66653 refuted. 0 times theorem prover too weak. 1265019 trivial. 0 not checked. [2024-09-20 12:16:07,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:16:08,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2131506 backedges. 799834 proven. 66653 refuted. 0 times theorem prover too weak. 1265019 trivial. 0 not checked. [2024-09-20 12:16:08,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414766993] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:16:08,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:16:08,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-20 12:16:08,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557667185] [2024-09-20 12:16:08,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:16:08,528 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 12:16:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:16:08,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 12:16:08,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:16:08,529 INFO L87 Difference]: Start difference. First operand 2781 states and 3129 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-20 12:16:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:16:09,495 INFO L93 Difference]: Finished difference Result 10385 states and 11698 transitions. [2024-09-20 12:16:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 12:16:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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 2780 [2024-09-20 12:16:09,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:16:09,536 INFO L225 Difference]: With dead ends: 10385 [2024-09-20 12:16:09,536 INFO L226 Difference]: Without dead ends: 8301 [2024-09-20 12:16:09,543 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5566 GetRequests, 5559 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-20 12:16:09,544 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:16:09,544 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 70 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:16:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8301 states. [2024-09-20 12:16:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8301 to 8301. [2024-09-20 12:16:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8301 states, 8297 states have (on average 1.1249849343136074) internal successors, (9334), 8297 states have internal predecessors, (9334), 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-20 12:16:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8301 states to 8301 states and 9337 transitions. [2024-09-20 12:16:10,400 INFO L78 Accepts]: Start accepts. Automaton has 8301 states and 9337 transitions. Word has length 2780 [2024-09-20 12:16:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:16:10,402 INFO L474 AbstractCegarLoop]: Abstraction has 8301 states and 9337 transitions. [2024-09-20 12:16:10,403 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-20 12:16:10,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:16:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 8301 states and 9337 transitions. [2024-09-20 12:16:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8301 [2024-09-20 12:16:10,942 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:16:10,944 INFO L216 NwaCegarLoop]: trace histogram [5184, 864, 864, 864, 144, 144, 144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:16:10,964 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-20 12:16:11,144 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-20 12:16:11,145 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:16:11,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:16:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash -245490195, now seen corresponding path program 7 times [2024-09-20 12:16:11,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:16:11,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947135162] [2024-09-20 12:16:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:16:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 12:16:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:16:48,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 12:16:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:16:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19191466 backedges. 0 proven. 14396710 refuted. 0 times theorem prover too weak. 4794756 trivial. 0 not checked. [2024-09-20 12:16:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 12:16:49,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947135162] [2024-09-20 12:16:49,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947135162] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 12:16:49,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720578936] [2024-09-20 12:16:49,607 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-20 12:16:49,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:16:49,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 12:16:49,610 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 12:16:49,611 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-20 12:16:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 12:16:53,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 21809 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 12:16:54,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 12:17:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 19191466 backedges. 0 proven. 14396710 refuted. 0 times theorem prover too weak. 4794756 trivial. 0 not checked. [2024-09-20 12:17:03,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 12:17:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19191466 backedges. 0 proven. 14396710 refuted. 0 times theorem prover too weak. 4794756 trivial. 0 not checked. [2024-09-20 12:17:11,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720578936] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 12:17:11,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 12:17:11,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-09-20 12:17:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670871829] [2024-09-20 12:17:11,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 12:17:11,785 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 12:17:11,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 12:17:11,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 12:17:11,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-20 12:17:11,786 INFO L87 Difference]: Start difference. First operand 8301 states and 9337 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-20 12:17:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 12:17:12,758 INFO L93 Difference]: Finished difference Result 12450 states and 14005 transitions. [2024-09-20 12:17:12,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 12:17:12,759 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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 8300 [2024-09-20 12:17:12,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 12:17:12,831 INFO L225 Difference]: With dead ends: 12450 [2024-09-20 12:17:12,831 INFO L226 Difference]: Without dead ends: 12447 [2024-09-20 12:17:12,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16608 GetRequests, 16597 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-20 12:17:12,838 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 12:17:12,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 12:17:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12447 states. [2024-09-20 12:17:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12447 to 12447. [2024-09-20 12:17:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12447 states, 12443 states have (on average 1.1249698625733344) internal successors, (13998), 12443 states have internal predecessors, (13998), 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-20 12:17:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12447 states to 12447 states and 14001 transitions. [2024-09-20 12:17:13,953 INFO L78 Accepts]: Start accepts. Automaton has 12447 states and 14001 transitions. Word has length 8300 [2024-09-20 12:17:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 12:17:13,966 INFO L474 AbstractCegarLoop]: Abstraction has 12447 states and 14001 transitions. [2024-09-20 12:17:13,967 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 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-20 12:17:13,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 12447 states and 14001 transitions. [2024-09-20 12:17:14,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12447 [2024-09-20 12:17:14,816 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 12:17:14,819 INFO L216 NwaCegarLoop]: trace histogram [7776, 1296, 1296, 1296, 216, 216, 216, 36, 36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 12:17:14,866 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-20 12:17:15,019 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 12:17:15,020 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 12:17:15,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 12:17:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash -837436019, now seen corresponding path program 8 times [2024-09-20 12:17:15,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 12:17:15,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491961460] [2024-09-20 12:17:15,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 12:17:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms