./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_3.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:31:18,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:31:18,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:31:18,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:31:18,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:31:18,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:31:18,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:31:18,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:31:18,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:31:18,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:31:18,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:31:18,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:31:18,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:31:18,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:31:18,976 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:31:18,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:31:18,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:31:18,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:31:18,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:31:18,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:31:18,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:31:18,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:31:18,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:31:18,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:31:18,981 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:31:18,981 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:31:18,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:31:18,981 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:31:18,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:31:18,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:31:18,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:31:18,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:31:18,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:31:18,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:31:18,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:31:18,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:31:18,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:31:18,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:31:18,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:31:18,985 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:31:18,985 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:31:18,985 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:31:18,985 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 14:31:19,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:31:19,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:31:19,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:31:19,201 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:31:19,201 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:31:19,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_3.c [2024-10-15 14:31:20,456 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:31:20,593 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:31:20,593 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_3.c [2024-10-15 14:31:20,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/15e62a7ba/fd6d12472d864a9e942f2dc71b180972/FLAG3f1006904 [2024-10-15 14:31:21,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/15e62a7ba/fd6d12472d864a9e942f2dc71b180972 [2024-10-15 14:31:21,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:31:21,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:31:21,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:31:21,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:31:21,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:31:21,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64b234da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21, skipping insertion in model container [2024-10-15 14:31:21,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:31:21,238 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_3.c[784,797] [2024-10-15 14:31:21,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:31:21,250 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:31:21,260 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_3.c[784,797] [2024-10-15 14:31:21,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:31:21,271 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:31:21,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21 WrapperNode [2024-10-15 14:31:21,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:31:21,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:31:21,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:31:21,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:31:21,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,288 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:31:21,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:31:21,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:31:21,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:31:21,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:31:21,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,307 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-10-15 14:31:21,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:31:21,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:31:21,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:31:21,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:31:21,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (1/1) ... [2024-10-15 14:31:21,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:31:21,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:21,348 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-10-15 14:31:21,350 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-10-15 14:31:21,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:31:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:31:21,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:31:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:31:21,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:31:21,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:31:21,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:31:21,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:31:21,426 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:31:21,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:31:21,508 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-15 14:31:21,509 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:31:21,524 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:31:21,525 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-15 14:31:21,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:31:21 BoogieIcfgContainer [2024-10-15 14:31:21,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:31:21,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:31:21,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:31:21,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:31:21,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:31:21" (1/3) ... [2024-10-15 14:31:21,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118f6319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:31:21, skipping insertion in model container [2024-10-15 14:31:21,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:31:21" (2/3) ... [2024-10-15 14:31:21,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118f6319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:31:21, skipping insertion in model container [2024-10-15 14:31:21,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:31:21" (3/3) ... [2024-10-15 14:31:21,530 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_3.c [2024-10-15 14:31:21,541 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:31:21,541 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:31:21,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:31:21,581 INFO L333 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;@44751beb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:31:21,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:31:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-15 14:31:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-15 14:31:21,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:21,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:21,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:21,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:21,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1012239947, now seen corresponding path program 1 times [2024-10-15 14:31:21,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:21,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133864088] [2024-10-15 14:31:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:21,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:21,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:21,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:21,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133864088] [2024-10-15 14:31:21,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133864088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:31:21,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:31:21,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:31:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461882599] [2024-10-15 14:31:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:31:21,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:31:21,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:21,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:31:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:31:21,710 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:21,731 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2024-10-15 14:31:21,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:31:21,732 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-10-15 14:31:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:21,737 INFO L225 Difference]: With dead ends: 29 [2024-10-15 14:31:21,737 INFO L226 Difference]: Without dead ends: 13 [2024-10-15 14:31:21,739 INFO L431 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-10-15 14:31:21,741 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:21,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-15 14:31:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-15 14:31:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-10-15 14:31:21,765 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2024-10-15 14:31:21,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:21,765 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-10-15 14:31:21,766 INFO L472 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-10-15 14:31:21,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-10-15 14:31:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-15 14:31:21,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:21,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:21,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:31:21,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:21,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:21,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1012211117, now seen corresponding path program 1 times [2024-10-15 14:31:21,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:21,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539938536] [2024-10-15 14:31:21,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:21,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:21,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:21,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539938536] [2024-10-15 14:31:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539938536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:31:21,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:31:21,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:31:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25362702] [2024-10-15 14:31:21,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:31:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:31:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:21,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:31:21,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:21,823 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:21,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:21,849 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-10-15 14:31:21,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:31:21,849 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-10-15 14:31:21,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:21,850 INFO L225 Difference]: With dead ends: 21 [2024-10-15 14:31:21,850 INFO L226 Difference]: Without dead ends: 18 [2024-10-15 14:31:21,850 INFO L431 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-10-15 14:31:21,851 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:21,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:21,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-15 14:31:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2024-10-15 14:31:21,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-10-15 14:31:21,855 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2024-10-15 14:31:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:21,855 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-10-15 14:31:21,855 INFO L472 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-10-15 14:31:21,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:21,855 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-10-15 14:31:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-15 14:31:21,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:21,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:21,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:31:21,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash -150948438, now seen corresponding path program 1 times [2024-10-15 14:31:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718292045] [2024-10-15 14:31:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:21,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:21,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:21,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:21,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718292045] [2024-10-15 14:31:21,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718292045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:31:21,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:31:21,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:31:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828853005] [2024-10-15 14:31:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:31:21,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:31:21,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:21,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:31:21,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:21,920 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:21,947 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-10-15 14:31:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:31:21,947 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-10-15 14:31:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:21,948 INFO L225 Difference]: With dead ends: 25 [2024-10-15 14:31:21,948 INFO L226 Difference]: Without dead ends: 17 [2024-10-15 14:31:21,948 INFO L431 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-10-15 14:31:21,949 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:21,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:21,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-15 14:31:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2024-10-15 14:31:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-10-15 14:31:21,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-10-15 14:31:21,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:21,956 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-10-15 14:31:21,956 INFO L472 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-10-15 14:31:21,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-10-15 14:31:21,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-15 14:31:21,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:21,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:21,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-15 14:31:21,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:21,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2014245097, now seen corresponding path program 1 times [2024-10-15 14:31:21,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:21,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080311025] [2024-10-15 14:31:21,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:21,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:22,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:22,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080311025] [2024-10-15 14:31:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080311025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:31:22,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:31:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:31:22,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167789967] [2024-10-15 14:31:22,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:31:22,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:31:22,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:31:22,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:31:22,015 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:22,025 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-10-15 14:31:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:31:22,026 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-10-15 14:31:22,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:22,026 INFO L225 Difference]: With dead ends: 25 [2024-10-15 14:31:22,026 INFO L226 Difference]: Without dead ends: 16 [2024-10-15 14:31:22,027 INFO L431 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-10-15 14:31:22,027 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:22,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-10-15 14:31:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-10-15 14:31:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-10-15 14:31:22,031 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2024-10-15 14:31:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:22,031 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-10-15 14:31:22,031 INFO L472 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-10-15 14:31:22,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-10-15 14:31:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-15 14:31:22,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:22,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:22,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-15 14:31:22,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:22,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:22,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1860063267, now seen corresponding path program 1 times [2024-10-15 14:31:22,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:22,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031007676] [2024-10-15 14:31:22,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:22,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:22,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:22,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:22,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031007676] [2024-10-15 14:31:22,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031007676] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:22,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383815158] [2024-10-15 14:31:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:22,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:22,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:22,099 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-10-15 14:31:22,100 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:31:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:22,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 14:31:22,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:22,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:22,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383815158] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:22,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:22,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-15 14:31:22,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656325794] [2024-10-15 14:31:22,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:22,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:31:22,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:22,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:31:22,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:31:22,222 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:22,249 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-10-15 14:31:22,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:31:22,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-15 14:31:22,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:22,250 INFO L225 Difference]: With dead ends: 29 [2024-10-15 14:31:22,251 INFO L226 Difference]: Without dead ends: 19 [2024-10-15 14:31:22,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:31:22,252 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:22,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-10-15 14:31:22,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-10-15 14:31:22,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-10-15 14:31:22,255 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2024-10-15 14:31:22,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:22,255 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-10-15 14:31:22,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:22,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:22,257 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-10-15 14:31:22,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-15 14:31:22,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:22,257 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:22,269 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-15 14:31:22,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:22,459 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:22,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2042556951, now seen corresponding path program 2 times [2024-10-15 14:31:22,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:22,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307747992] [2024-10-15 14:31:22,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:22,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:22,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-15 14:31:22,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:22,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307747992] [2024-10-15 14:31:22,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307747992] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:22,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607542436] [2024-10-15 14:31:22,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:31:22,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:22,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:22,508 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-10-15 14:31:22,509 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:31:22,545 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:31:22,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:22,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 14:31:22,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:22,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:22,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:31:22,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607542436] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:22,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:22,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-10-15 14:31:22,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123889886] [2024-10-15 14:31:22,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:22,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-15 14:31:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:22,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-15 14:31:22,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-15 14:31:22,641 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:22,783 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-10-15 14:31:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-15 14:31:22,783 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-10-15 14:31:22,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:22,784 INFO L225 Difference]: With dead ends: 51 [2024-10-15 14:31:22,784 INFO L226 Difference]: Without dead ends: 38 [2024-10-15 14:31:22,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-10-15 14:31:22,787 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:22,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-15 14:31:22,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-10-15 14:31:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:22,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-10-15 14:31:22,792 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2024-10-15 14:31:22,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:22,792 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-10-15 14:31:22,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:22,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:22,793 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-10-15 14:31:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-15 14:31:22,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:22,793 INFO L215 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:22,805 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:31:22,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-15 14:31:22,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:22,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1056908150, now seen corresponding path program 3 times [2024-10-15 14:31:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:22,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040296691] [2024-10-15 14:31:22,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:23,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-15 14:31:23,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040296691] [2024-10-15 14:31:23,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040296691] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:23,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507947017] [2024-10-15 14:31:23,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:31:23,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:23,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:23,068 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-10-15 14:31:23,069 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:31:23,102 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-15 14:31:23,103 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:23,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-15 14:31:23,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-15 14:31:23,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-15 14:31:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507947017] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:23,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:23,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-15 14:31:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192143848] [2024-10-15 14:31:23,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:23,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:31:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:31:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:31:23,181 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:23,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:23,219 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-10-15 14:31:23,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:31:23,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-10-15 14:31:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:23,220 INFO L225 Difference]: With dead ends: 96 [2024-10-15 14:31:23,220 INFO L226 Difference]: Without dead ends: 93 [2024-10-15 14:31:23,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:31:23,221 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:23,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:23,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-15 14:31:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-15 14:31:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.146067415730337) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2024-10-15 14:31:23,234 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 29 [2024-10-15 14:31:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:23,234 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-10-15 14:31:23,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:23,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2024-10-15 14:31:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-15 14:31:23,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:23,239 INFO L215 NwaCegarLoop]: trace histogram [48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:23,252 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 14:31:23,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-15 14:31:23,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:23,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1817816557, now seen corresponding path program 4 times [2024-10-15 14:31:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444674508] [2024-10-15 14:31:23,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:23,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-10-15 14:31:23,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444674508] [2024-10-15 14:31:23,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444674508] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695268582] [2024-10-15 14:31:23,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 14:31:23,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:23,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:23,596 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-10-15 14:31:23,597 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:31:23,660 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 14:31:23,661 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:23,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-15 14:31:23,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-10-15 14:31:23,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-10-15 14:31:23,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695268582] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:23,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:23,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-15 14:31:23,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211663617] [2024-10-15 14:31:23,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:23,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:31:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:23,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:31:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:31:23,752 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:23,798 INFO L93 Difference]: Finished difference Result 305 states and 358 transitions. [2024-10-15 14:31:23,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:31:23,799 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-10-15 14:31:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:23,800 INFO L225 Difference]: With dead ends: 305 [2024-10-15 14:31:23,800 INFO L226 Difference]: Without dead ends: 237 [2024-10-15 14:31:23,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:31:23,801 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:23,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:23,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-15 14:31:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-10-15 14:31:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.1244635193133048) internal successors, (262), 233 states have internal predecessors, (262), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2024-10-15 14:31:23,830 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 92 [2024-10-15 14:31:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:23,830 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2024-10-15 14:31:23,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:23,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2024-10-15 14:31:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-10-15 14:31:23,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:23,833 INFO L215 NwaCegarLoop]: trace histogram [144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:23,846 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-15 14:31:24,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:24,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:24,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:24,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2114622189, now seen corresponding path program 5 times [2024-10-15 14:31:24,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:24,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914827523] [2024-10-15 14:31:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:24,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-10-15 14:31:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914827523] [2024-10-15 14:31:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914827523] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916659440] [2024-10-15 14:31:24,438 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 14:31:24,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:24,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:24,439 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-10-15 14:31:24,440 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:31:24,587 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2024-10-15 14:31:24,588 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:24,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 14:31:24,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-10-15 14:31:24,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-10-15 14:31:25,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916659440] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:25,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:25,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-10-15 14:31:25,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954763914] [2024-10-15 14:31:25,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:25,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-15 14:31:25,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:25,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-15 14:31:25,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:31:25,074 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:25,126 INFO L93 Difference]: Finished difference Result 354 states and 397 transitions. [2024-10-15 14:31:25,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 14:31:25,126 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 236 [2024-10-15 14:31:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:25,129 INFO L225 Difference]: With dead ends: 354 [2024-10-15 14:31:25,129 INFO L226 Difference]: Without dead ends: 351 [2024-10-15 14:31:25,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 469 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-15 14:31:25,133 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:25,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:31:25,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-10-15 14:31:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-10-15 14:31:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 347 states have (on average 1.1239193083573487) internal successors, (390), 347 states have internal predecessors, (390), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 393 transitions. [2024-10-15 14:31:25,177 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 393 transitions. Word has length 236 [2024-10-15 14:31:25,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:25,178 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 393 transitions. [2024-10-15 14:31:25,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:25,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:25,178 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 393 transitions. [2024-10-15 14:31:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-15 14:31:25,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:31:25,185 INFO L215 NwaCegarLoop]: trace histogram [216, 36, 36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:31:25,201 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-15 14:31:25,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:25,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:31:25,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1900573069, now seen corresponding path program 6 times [2024-10-15 14:31:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:31:25,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644051693] [2024-10-15 14:31:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:31:25,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:31:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:31:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:31:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 0 proven. 28563 refuted. 0 times theorem prover too weak. 4590 trivial. 0 not checked. [2024-10-15 14:31:26,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:31:26,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644051693] [2024-10-15 14:31:26,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644051693] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:31:26,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408252275] [2024-10-15 14:31:26,474 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 14:31:26,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:31:26,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:31:26,476 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-10-15 14:31:26,477 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:31:26,601 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 59 check-sat command(s) [2024-10-15 14:31:26,601 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:31:26,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-15 14:31:26,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:31:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 9512 proven. 21 refuted. 0 times theorem prover too weak. 23620 trivial. 0 not checked. [2024-10-15 14:31:26,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:31:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 9256 proven. 277 refuted. 0 times theorem prover too weak. 23620 trivial. 0 not checked. [2024-10-15 14:31:27,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408252275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:31:27,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:31:27,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 41 [2024-10-15 14:31:27,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259010438] [2024-10-15 14:31:27,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:31:27,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-15 14:31:27,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:31:27,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-15 14:31:27,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1303, Unknown=0, NotChecked=0, Total=1640 [2024-10-15 14:31:27,251 INFO L87 Difference]: Start difference. First operand 351 states and 393 transitions. Second operand has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 41 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:30,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:31:30,813 INFO L93 Difference]: Finished difference Result 687 states and 772 transitions. [2024-10-15 14:31:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2024-10-15 14:31:30,814 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 41 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 350 [2024-10-15 14:31:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:31:30,815 INFO L225 Difference]: With dead ends: 687 [2024-10-15 14:31:30,815 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 14:31:30,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 686 SyntacticMatches, 2 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34264 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=9112, Invalid=78208, Unknown=0, NotChecked=0, Total=87320 [2024-10-15 14:31:30,836 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:31:30,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:31:30,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 14:31:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 14:31:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 14:31:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 14:31:30,838 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 350 [2024-10-15 14:31:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:31:30,838 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 14:31:30,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 41 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 14:31:30,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:31:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 14:31:30,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 14:31:30,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 14:31:30,853 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-15 14:31:31,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-15 14:31:31,047 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2024-10-15 14:31:31,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 14:31:34,212 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 14:31:34,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 02:31:34 BoogieIcfgContainer [2024-10-15 14:31:34,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 14:31:34,228 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 14:31:34,229 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 14:31:34,229 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 14:31:34,229 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:31:21" (3/4) ... [2024-10-15 14:31:34,230 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 14:31:34,274 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 14:31:34,274 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 14:31:34,274 INFO L158 Benchmark]: Toolchain (without parser) took 13257.81ms. Allocated memory was 161.5MB in the beginning and 549.5MB in the end (delta: 388.0MB). Free memory was 94.7MB in the beginning and 354.1MB in the end (delta: -259.5MB). Peak memory consumption was 131.4MB. Max. memory is 16.1GB. [2024-10-15 14:31:34,275 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:31:34,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.84ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 132.1MB in the end (delta: -37.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-15 14:31:34,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.61ms. Allocated memory is still 161.5MB. Free memory was 132.1MB in the beginning and 131.2MB in the end (delta: 822.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:31:34,275 INFO L158 Benchmark]: Boogie Preprocessor took 29.62ms. Allocated memory is still 161.5MB. Free memory was 131.2MB in the beginning and 129.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 14:31:34,276 INFO L158 Benchmark]: RCFGBuilder took 206.45ms. Allocated memory is still 161.5MB. Free memory was 129.7MB in the beginning and 118.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 14:31:34,276 INFO L158 Benchmark]: TraceAbstraction took 12701.47ms. Allocated memory was 161.5MB in the beginning and 549.5MB in the end (delta: 388.0MB). Free memory was 117.5MB in the beginning and 356.1MB in the end (delta: -238.6MB). Peak memory consumption was 318.6MB. Max. memory is 16.1GB. [2024-10-15 14:31:34,277 INFO L158 Benchmark]: Witness Printer took 45.65ms. Allocated memory is still 549.5MB. Free memory was 356.1MB in the beginning and 354.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 14:31:34,278 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 70.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.84ms. Allocated memory is still 161.5MB. Free memory was 94.5MB in the beginning and 132.1MB in the end (delta: -37.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.61ms. Allocated memory is still 161.5MB. Free memory was 132.1MB in the beginning and 131.2MB in the end (delta: 822.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.62ms. Allocated memory is still 161.5MB. Free memory was 131.2MB in the beginning and 129.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 206.45ms. Allocated memory is still 161.5MB. Free memory was 129.7MB in the beginning and 118.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12701.47ms. Allocated memory was 161.5MB in the beginning and 549.5MB in the end (delta: 388.0MB). Free memory was 117.5MB in the beginning and 356.1MB in the end (delta: -238.6MB). Peak memory consumption was 318.6MB. Max. memory is 16.1GB. * Witness Printer took 45.65ms. Allocated memory is still 549.5MB. Free memory was 356.1MB in the beginning and 354.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 10, TraceHistogramMax: 216, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 474 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 112 mSDtfsCounter, 474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 1474 SyntacticMatches, 10 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34391 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=9, InterpolantAutomatonStates: 329, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 2239 ConstructedInterpolants, 0 QuantifiedInterpolants, 5413 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1580 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 86462/148839 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((c == 6) && (b <= 6)) && (a <= 5)) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((b == 6) && (c == 6)) && (a <= 6)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((b <= 5) && (a <= 5)) && (c == 1)) || (((b <= 5) && (5 == c)) && (a <= 5))) || (((c == 6) && (b <= 5)) && (a <= 5))) || (((b <= 5) && (a <= 5)) && (c == 3))) || (((b <= 5) && (c == 0)) && (a <= 5))) || (((b <= 5) && (c == 2)) && (a <= 5))) || (((b <= 5) && (c == 4)) && (a <= 5))) RESULT: Ultimate proved your program to be correct! [2024-10-15 14:31:34,301 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE