./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.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 de325976 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.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 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-de32597-m [2024-09-17 19:21:20,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 19:21:20,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 19:21:20,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 19:21:20,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 19:21:20,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 19:21:20,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 19:21:20,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 19:21:20,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 19:21:20,140 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 19:21:20,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 19:21:20,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 19:21:20,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 19:21:20,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 19:21:20,151 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 19:21:20,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 19:21:20,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 19:21:20,152 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 19:21:20,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 19:21:20,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 19:21:20,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 19:21:20,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 19:21:20,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 19:21:20,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 19:21:20,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 19:21:20,155 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 19:21:20,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 19:21:20,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 19:21:20,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 19:21:20,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 19:21:20,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 19:21:20,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 19:21:20,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:21:20,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 19:21:20,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 19:21:20,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 19:21:20,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 19:21:20,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 19:21:20,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 19:21:20,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 19:21:20,159 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 19:21:20,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 19:21:20,159 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 -> 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-17 19:21:20,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 19:21:20,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 19:21:20,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 19:21:20,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 19:21:20,393 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 19:21:20,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2024-09-17 19:21:21,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 19:21:21,816 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 19:21:21,816 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2024-09-17 19:21:21,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c289bd0cb/da4877f890b148d099222524076cdfe1/FLAG64374cce2 [2024-09-17 19:21:21,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c289bd0cb/da4877f890b148d099222524076cdfe1 [2024-09-17 19:21:21,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 19:21:21,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 19:21:21,835 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 19:21:21,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 19:21:21,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 19:21:21,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:21:21" (1/1) ... [2024-09-17 19:21:21,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@214690eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:21, skipping insertion in model container [2024-09-17 19:21:21,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 07:21:21" (1/1) ... [2024-09-17 19:21:21,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 19:21:21,970 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/recursive-simple/id2_i5_o5-2.c[548,561] [2024-09-17 19:21:21,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:21:21,984 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 19:21:21,994 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/recursive-simple/id2_i5_o5-2.c[548,561] [2024-09-17 19:21:21,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 19:21:22,006 INFO L204 MainTranslator]: Completed translation [2024-09-17 19:21:22,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22 WrapperNode [2024-09-17 19:21:22,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 19:21:22,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 19:21:22,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 19:21:22,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 19:21:22,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,022 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 19:21:22,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 19:21:22,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 19:21:22,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 19:21:22,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 19:21:22,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,038 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-17 19:21:22,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,040 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 19:21:22,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 19:21:22,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 19:21:22,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 19:21:22,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (1/1) ... [2024-09-17 19:21:22,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 19:21:22,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:21:22,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-17 19:21:22,080 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-17 19:21:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 19:21:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 19:21:22,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 19:21:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 19:21:22,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 19:21:22,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 19:21:22,116 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2024-09-17 19:21:22,116 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2024-09-17 19:21:22,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 19:21:22,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 19:21:22,116 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-17 19:21:22,116 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-17 19:21:22,169 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 19:21:22,170 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 19:21:22,317 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-17 19:21:22,318 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 19:21:22,330 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 19:21:22,331 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-17 19:21:22,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:21:22 BoogieIcfgContainer [2024-09-17 19:21:22,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 19:21:22,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 19:21:22,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 19:21:22,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 19:21:22,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 07:21:21" (1/3) ... [2024-09-17 19:21:22,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451d6d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:21:22, skipping insertion in model container [2024-09-17 19:21:22,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 07:21:22" (2/3) ... [2024-09-17 19:21:22,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451d6d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 07:21:22, skipping insertion in model container [2024-09-17 19:21:22,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:21:22" (3/3) ... [2024-09-17 19:21:22,337 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2024-09-17 19:21:22,349 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 19:21:22,350 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 19:21:22,393 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 19:21:22,398 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4752163b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 19:21:22,399 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 19:21:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-17 19:21:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-17 19:21:22,407 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:21:22,407 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:21:22,408 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:21:22,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -600647039, now seen corresponding path program 1 times [2024-09-17 19:21:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:21:22,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224556945] [2024-09-17 19:21:22,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:21:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:21:22,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:22,598 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:21:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:22,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:21:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 19:21:22,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:21:22,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224556945] [2024-09-17 19:21:22,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224556945] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:21:22,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:21:22,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-17 19:21:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350728990] [2024-09-17 19:21:22,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:21:22,684 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-17 19:21:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:21:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-17 19:21:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:21:22,715 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-17 19:21:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:21:22,771 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-09-17 19:21:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-17 19:21:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-09-17 19:21:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:21:22,778 INFO L225 Difference]: With dead ends: 36 [2024-09-17 19:21:22,778 INFO L226 Difference]: Without dead ends: 24 [2024-09-17 19:21:22,780 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-17 19:21:22,783 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 19:21:22,784 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:21:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-17 19:21:22,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-17 19:21:22,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-17 19:21:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-09-17 19:21:22,811 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 13 [2024-09-17 19:21:22,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:21:22,811 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-09-17 19:21:22,812 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-17 19:21:22,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-09-17 19:21:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-17 19:21:22,813 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:21:22,813 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:21:22,814 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 19:21:22,814 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:21:22,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1186051473, now seen corresponding path program 1 times [2024-09-17 19:21:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:21:22,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593451746] [2024-09-17 19:21:22,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:21:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:21:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:22,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:21:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:22,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:21:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:22,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:22,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-17 19:21:22,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:21:22,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593451746] [2024-09-17 19:21:22,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593451746] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:21:22,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 19:21:22,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 19:21:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891460218] [2024-09-17 19:21:22,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:21:22,960 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 19:21:22,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:21:22,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 19:21:22,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-17 19:21:22,961 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-17 19:21:23,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:21:23,020 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-09-17 19:21:23,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-17 19:21:23,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-09-17 19:21:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:21:23,021 INFO L225 Difference]: With dead ends: 33 [2024-09-17 19:21:23,021 INFO L226 Difference]: Without dead ends: 29 [2024-09-17 19:21:23,022 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-17 19:21:23,022 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-17 19:21:23,023 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 70 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-17 19:21:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-17 19:21:23,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-17 19:21:23,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-17 19:21:23,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-09-17 19:21:23,029 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2024-09-17 19:21:23,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:21:23,029 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-09-17 19:21:23,030 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-17 19:21:23,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:23,030 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-09-17 19:21:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-17 19:21:23,031 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:21:23,031 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:21:23,031 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-17 19:21:23,031 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:21:23,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:23,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1993719855, now seen corresponding path program 1 times [2024-09-17 19:21:23,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:21:23,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674218685] [2024-09-17 19:21:23,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:21:23,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:21:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:23,103 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:21:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:23,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:21:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:23,189 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:23,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-17 19:21:23,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:21:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674218685] [2024-09-17 19:21:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674218685] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:21:23,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031992771] [2024-09-17 19:21:23,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:21:23,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:23,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:21:23,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:21:23,307 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-17 19:21:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:23,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-17 19:21:23,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:21:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-17 19:21:23,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:21:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-17 19:21:23,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031992771] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:21:23,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:21:23,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2024-09-17 19:21:23,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057537772] [2024-09-17 19:21:23,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:21:23,711 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-17 19:21:23,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:21:23,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-17 19:21:23,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-09-17 19:21:23,713 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 9 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-17 19:21:23,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:21:23,799 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-09-17 19:21:23,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-17 19:21:23,800 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 9 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 9 states have call successors, (9) Word has length 25 [2024-09-17 19:21:23,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:21:23,801 INFO L225 Difference]: With dead ends: 39 [2024-09-17 19:21:23,801 INFO L226 Difference]: Without dead ends: 35 [2024-09-17 19:21:23,802 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-09-17 19:21:23,803 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:21:23,803 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 117 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:21:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-17 19:21:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2024-09-17 19:21:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-17 19:21:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-09-17 19:21:23,810 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2024-09-17 19:21:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:21:23,810 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-09-17 19:21:23,810 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 9 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-17 19:21:23,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-09-17 19:21:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-17 19:21:23,811 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:21:23,811 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:21:23,827 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-17 19:21:24,012 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:24,012 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:21:24,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:24,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1577860927, now seen corresponding path program 1 times [2024-09-17 19:21:24,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:21:24,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918425331] [2024-09-17 19:21:24,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:21:24,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:21:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:24,048 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:21:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:24,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:21:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:24,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:24,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:24,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-17 19:21:24,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:21:24,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918425331] [2024-09-17 19:21:24,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918425331] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:21:24,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203475320] [2024-09-17 19:21:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:21:24,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:24,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:21:24,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:21:24,214 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-17 19:21:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:24,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-17 19:21:24,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:21:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-17 19:21:24,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:21:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-17 19:21:24,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203475320] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:21:24,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:21:24,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 18 [2024-09-17 19:21:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185857193] [2024-09-17 19:21:24,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:21:24,807 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-17 19:21:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:21:24,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-17 19:21:24,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-09-17 19:21:24,810 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 10 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12) [2024-09-17 19:21:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:21:24,891 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-09-17 19:21:24,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-17 19:21:24,891 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 10 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12) Word has length 31 [2024-09-17 19:21:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:21:24,892 INFO L225 Difference]: With dead ends: 45 [2024-09-17 19:21:24,892 INFO L226 Difference]: Without dead ends: 41 [2024-09-17 19:21:24,893 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-09-17 19:21:24,893 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:21:24,894 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 172 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:21:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-17 19:21:24,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2024-09-17 19:21:24,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-17 19:21:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-09-17 19:21:24,900 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2024-09-17 19:21:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:21:24,900 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-09-17 19:21:24,900 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 10 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12) [2024-09-17 19:21:24,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-09-17 19:21:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-17 19:21:24,903 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:21:24,903 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:21:24,920 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-17 19:21:25,103 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:25,104 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:21:25,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:25,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1839833823, now seen corresponding path program 2 times [2024-09-17 19:21:25,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:21:25,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558600117] [2024-09-17 19:21:25,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:21:25,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:21:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:25,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:21:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:25,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:21:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:25,201 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:25,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:25,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:25,322 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-17 19:21:25,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:21:25,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558600117] [2024-09-17 19:21:25,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558600117] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:21:25,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999170864] [2024-09-17 19:21:25,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-17 19:21:25,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:25,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:21:25,366 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:21:25,367 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-17 19:21:25,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-17 19:21:25,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 19:21:25,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-17 19:21:25,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:21:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-17 19:21:25,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:21:26,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-17 19:21:26,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999170864] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:21:26,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:21:26,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 19 [2024-09-17 19:21:26,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570137638] [2024-09-17 19:21:26,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:21:26,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-17 19:21:26,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:21:26,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-17 19:21:26,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-09-17 19:21:26,221 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-17 19:21:26,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:21:26,315 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-09-17 19:21:26,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-17 19:21:26,317 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14) Word has length 37 [2024-09-17 19:21:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:21:26,317 INFO L225 Difference]: With dead ends: 51 [2024-09-17 19:21:26,317 INFO L226 Difference]: Without dead ends: 47 [2024-09-17 19:21:26,318 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2024-09-17 19:21:26,318 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:21:26,318 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 131 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:21:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-17 19:21:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2024-09-17 19:21:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-17 19:21:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2024-09-17 19:21:26,329 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 37 [2024-09-17 19:21:26,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:21:26,330 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2024-09-17 19:21:26,331 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-17 19:21:26,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2024-09-17 19:21:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-17 19:21:26,332 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:21:26,333 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:21:26,350 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-17 19:21:26,533 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:26,534 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:21:26,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:26,534 INFO L85 PathProgramCache]: Analyzing trace with hash 342772751, now seen corresponding path program 2 times [2024-09-17 19:21:26,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:21:26,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653821415] [2024-09-17 19:21:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:21:26,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:21:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:26,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:21:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:26,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:21:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:26,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:26,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:26,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:26,832 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:26,859 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-17 19:21:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:21:26,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653821415] [2024-09-17 19:21:26,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653821415] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:21:26,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895737870] [2024-09-17 19:21:26,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-17 19:21:26,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:26,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:21:26,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:21:26,883 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-17 19:21:26,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-17 19:21:26,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 19:21:26,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-17 19:21:26,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:21:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-17 19:21:26,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 19:21:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-17 19:21:27,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895737870] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 19:21:27,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-17 19:21:27,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2024-09-17 19:21:27,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110109271] [2024-09-17 19:21:27,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-17 19:21:27,102 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-17 19:21:27,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:21:27,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-17 19:21:27,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-09-17 19:21:27,103 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-17 19:21:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:21:27,166 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2024-09-17 19:21:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-17 19:21:27,166 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2024-09-17 19:21:27,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:21:27,167 INFO L225 Difference]: With dead ends: 57 [2024-09-17 19:21:27,167 INFO L226 Difference]: Without dead ends: 53 [2024-09-17 19:21:27,167 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-09-17 19:21:27,168 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:21:27,168 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:21:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-17 19:21:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2024-09-17 19:21:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 9 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-17 19:21:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-09-17 19:21:27,175 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2024-09-17 19:21:27,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:21:27,175 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-09-17 19:21:27,175 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 7 states have return successors, (7), 7 states have call predecessors, (7), 1 states have call successors, (7) [2024-09-17 19:21:27,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-09-17 19:21:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-17 19:21:27,176 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:21:27,176 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:21:27,190 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-17 19:21:27,380 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:27,381 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:21:27,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:27,381 INFO L85 PathProgramCache]: Analyzing trace with hash 872362609, now seen corresponding path program 3 times [2024-09-17 19:21:27,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:21:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613640191] [2024-09-17 19:21:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:21:27,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:21:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:27,417 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:21:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:27,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:21:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:27,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:27,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:27,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:27,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:27,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:27,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:27,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-17 19:21:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:21:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613640191] [2024-09-17 19:21:27,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613640191] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:21:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354550109] [2024-09-17 19:21:27,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-17 19:21:27,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:27,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:21:27,604 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:21:27,605 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-17 19:21:27,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-17 19:21:27,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 19:21:27,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-17 19:21:27,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:21:27,751 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-17 19:21:27,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 19:21:27,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354550109] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:21:27,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-17 19:21:27,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 16 [2024-09-17 19:21:27,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859969716] [2024-09-17 19:21:27,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:21:27,751 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-17 19:21:27,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:21:27,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-17 19:21:27,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-09-17 19:21:27,752 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-17 19:21:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:21:27,864 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-09-17 19:21:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-17 19:21:27,865 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) Word has length 49 [2024-09-17 19:21:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:21:27,865 INFO L225 Difference]: With dead ends: 63 [2024-09-17 19:21:27,866 INFO L226 Difference]: Without dead ends: 39 [2024-09-17 19:21:27,866 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-09-17 19:21:27,867 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:21:27,867 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 183 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:21:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-17 19:21:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-17 19:21:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 9 states have return successors, (10), 9 states have call predecessors, (10), 4 states have call successors, (10) [2024-09-17 19:21:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-09-17 19:21:27,873 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 49 [2024-09-17 19:21:27,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:21:27,873 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-09-17 19:21:27,873 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (8), 8 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-17 19:21:27,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-09-17 19:21:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-17 19:21:27,874 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 19:21:27,874 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-17 19:21:27,887 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-17 19:21:28,074 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-17 19:21:28,075 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 19:21:28,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1842056993, now seen corresponding path program 3 times [2024-09-17 19:21:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 19:21:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781715053] [2024-09-17 19:21:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 19:21:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 19:21:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:28,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 19:21:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:28,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 19:21:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:28,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:28,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:28,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:28,258 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:28,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:28,327 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:28,356 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-17 19:21:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 19:21:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-17 19:21:28,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 19:21:28,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781715053] [2024-09-17 19:21:28,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781715053] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 19:21:28,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676358752] [2024-09-17 19:21:28,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-17 19:21:28,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:28,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 19:21:28,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-17 19:21:28,382 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-17 19:21:28,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-17 19:21:28,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-17 19:21:28,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-17 19:21:28,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 19:21:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-09-17 19:21:28,498 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 19:21:28,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676358752] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 19:21:28,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-17 19:21:28,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 17 [2024-09-17 19:21:28,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771033194] [2024-09-17 19:21:28,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 19:21:28,499 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-17 19:21:28,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 19:21:28,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-17 19:21:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-09-17 19:21:28,500 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-17 19:21:28,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 19:21:28,615 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-09-17 19:21:28,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-17 19:21:28,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) Word has length 55 [2024-09-17 19:21:28,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 19:21:28,616 INFO L225 Difference]: With dead ends: 39 [2024-09-17 19:21:28,616 INFO L226 Difference]: Without dead ends: 0 [2024-09-17 19:21:28,617 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2024-09-17 19:21:28,617 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-17 19:21:28,618 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 161 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-17 19:21:28,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-17 19:21:28,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-17 19:21:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-17 19:21:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-17 19:21:28,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2024-09-17 19:21:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 19:21:28,619 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-17 19:21:28,619 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (5), 1 states have call predecessors, (5), 9 states have return successors, (9), 9 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-17 19:21:28,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 19:21:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-17 19:21:28,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-17 19:21:28,621 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-17 19:21:28,634 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-17 19:21:28,825 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-17 19:21:28,828 INFO L408 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2024-09-17 19:21:28,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-17 19:21:29,677 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-17 19:21:29,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.09 07:21:29 BoogieIcfgContainer [2024-09-17 19:21:29,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-17 19:21:29,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-17 19:21:29,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-17 19:21:29,697 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-17 19:21:29,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 07:21:22" (3/4) ... [2024-09-17 19:21:29,699 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-17 19:21:29,738 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-17 19:21:29,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-17 19:21:29,739 INFO L158 Benchmark]: Toolchain (without parser) took 7904.42ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 92.6MB in the beginning and 185.3MB in the end (delta: -92.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 19:21:29,739 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 19:21:29,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.66ms. Allocated memory is still 161.5MB. Free memory was 92.3MB in the beginning and 81.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-17 19:21:29,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 14.71ms. Allocated memory is still 161.5MB. Free memory was 81.2MB in the beginning and 80.2MB in the end (delta: 909.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 19:21:29,739 INFO L158 Benchmark]: Boogie Preprocessor took 20.77ms. Allocated memory is still 161.5MB. Free memory was 80.2MB in the beginning and 78.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 19:21:29,740 INFO L158 Benchmark]: RCFGBuilder took 287.41ms. Allocated memory is still 161.5MB. Free memory was 78.6MB in the beginning and 128.0MB in the end (delta: -49.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-09-17 19:21:29,740 INFO L158 Benchmark]: TraceAbstraction took 7363.54ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 127.4MB in the beginning and 188.5MB in the end (delta: -61.1MB). Peak memory consumption was 137.7MB. Max. memory is 16.1GB. [2024-09-17 19:21:29,740 INFO L158 Benchmark]: Witness Printer took 41.64ms. Allocated memory is still 234.9MB. Free memory was 187.4MB in the beginning and 185.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 19:21:29,741 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.14ms. Allocated memory is still 113.2MB. Free memory is still 80.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.66ms. Allocated memory is still 161.5MB. Free memory was 92.3MB in the beginning and 81.2MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 14.71ms. Allocated memory is still 161.5MB. Free memory was 81.2MB in the beginning and 80.2MB in the end (delta: 909.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.77ms. Allocated memory is still 161.5MB. Free memory was 80.2MB in the beginning and 78.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 287.41ms. Allocated memory is still 161.5MB. Free memory was 78.6MB in the beginning and 128.0MB in the end (delta: -49.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7363.54ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 127.4MB in the beginning and 188.5MB in the end (delta: -61.1MB). Peak memory consumption was 137.7MB. Max. memory is 16.1GB. * Witness Printer took 41.64ms. Allocated memory is still 234.9MB. Free memory was 187.4MB in the beginning and 185.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1160 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 679 IncrementalHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 181 mSDtfsCounter, 679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 414 SyntacticMatches, 13 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=6, InterpolantAutomatonStates: 83, 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, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 1512 SizeOfPredicates, 22 NumberOfNonLiveVariables, 672 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 295/426 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 - ProcedureContractResult [Line: 14]: Procedure Contract for id2 Derived contract for procedure id2. Ensures: ((((((\old(x) == 0) && (\result == 0)) || (\old(x) == 1)) || (((\result == 2) && (\old(x) <= 3)) && (2 <= \old(x)))) || (4 < \old(x))) || (((3 == \old(x)) || (\result == 4)) && (3 <= \old(x)))) - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id. Ensures: ((((((\old(x) == 0) || (\old(x) == 4)) || ((5 == \result) && (5 == \old(x)))) || ((((3 == \result) && (\old(x) <= 4)) || (\old(x) == 2)) && (2 <= \old(x)))) || (((\result == 1) && (\old(x) <= 2)) && (1 <= \old(x)))) || (5 < \old(x))) RESULT: Ultimate proved your program to be correct! [2024-09-17 19:21:29,767 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