./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i10_o10-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 e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i10_o10-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 3f8ee4f5181b3404c1367dbf131683f1e761cea6b176154f687b628466c991fe --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:13:34,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:13:34,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:13:34,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:13:34,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:13:34,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:13:34,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:13:34,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:13:34,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:13:34,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:13:34,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:13:34,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:13:34,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:13:34,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:13:34,120 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:13:34,120 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:13:34,120 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:13:34,120 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:13:34,121 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:13:34,121 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:13:34,121 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:13:34,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:13:34,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:13:34,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:13:34,126 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:13:34,126 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:13:34,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:13:34,127 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:13:34,127 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:13:34,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:13:34,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:13:34,128 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:13:34,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:13:34,128 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:13:34,128 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:13:34,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:13:34,129 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:13:34,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:13:34,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:13:34,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:13:34,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:13:34,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:13:34,131 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 -> 3f8ee4f5181b3404c1367dbf131683f1e761cea6b176154f687b628466c991fe Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 15:13:34,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:13:34,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:13:34,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:13:34,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:13:34,387 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:13:34,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id_i10_o10-2.c [2024-10-15 15:13:35,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:13:35,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:13:35,964 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id_i10_o10-2.c [2024-10-15 15:13:35,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/19fe03ac3/61654d508ff5418fad2b97a4bc1a6954/FLAGe36e485b0 [2024-10-15 15:13:35,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/19fe03ac3/61654d508ff5418fad2b97a4bc1a6954 [2024-10-15 15:13:35,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:13:35,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:13:35,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:13:35,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:13:35,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:13:35,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:13:35" (1/1) ... [2024-10-15 15:13:36,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd39052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:35, skipping insertion in model container [2024-10-15 15:13:36,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:13:35" (1/1) ... [2024-10-15 15:13:36,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:13:36,176 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/id_i10_o10-2.c[454,467] [2024-10-15 15:13:36,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:13:36,192 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:13:36,202 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/id_i10_o10-2.c[454,467] [2024-10-15 15:13:36,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:13:36,221 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:13:36,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36 WrapperNode [2024-10-15 15:13:36,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:13:36,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:13:36,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:13:36,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:13:36,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,242 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:13:36,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:13:36,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:13:36,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:13:36,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:13:36,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,253 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,263 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-15 15:13:36,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:13:36,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:13:36,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:13:36,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:13:36,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (1/1) ... [2024-10-15 15:13:36,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:13:36,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:36,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 15:13:36,307 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 15:13:36,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:13:36,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:13:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:13:36,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:13:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:13:36,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:13:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:13:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:13:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-10-15 15:13:36,355 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-10-15 15:13:36,408 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:13:36,410 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:13:36,526 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-15 15:13:36,526 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:13:36,557 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:13:36,559 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:13:36,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:13:36 BoogieIcfgContainer [2024-10-15 15:13:36,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:13:36,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:13:36,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:13:36,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:13:36,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:13:35" (1/3) ... [2024-10-15 15:13:36,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bef5ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:13:36, skipping insertion in model container [2024-10-15 15:13:36,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:13:36" (2/3) ... [2024-10-15 15:13:36,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bef5ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:13:36, skipping insertion in model container [2024-10-15 15:13:36,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:13:36" (3/3) ... [2024-10-15 15:13:36,571 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i10_o10-2.c [2024-10-15 15:13:36,609 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:13:36,609 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:13:36,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:13:36,687 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@241618c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:13:36,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:13:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-15 15:13:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-15 15:13:36,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:36,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:36,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:36,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:36,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2082045565, now seen corresponding path program 1 times [2024-10-15 15:13:36,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:36,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577408530] [2024-10-15 15:13:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:36,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:36,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:36,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:13:36,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:36,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577408530] [2024-10-15 15:13:36,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577408530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:13:36,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:13:36,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 15:13:36,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717366037] [2024-10-15 15:13:36,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:13:36,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 15:13:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:37,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 15:13:37,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 15:13:37,008 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-10-15 15:13:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:37,072 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-10-15 15:13:37,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 15:13:37,079 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-10-15 15:13:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:37,086 INFO L225 Difference]: With dead ends: 30 [2024-10-15 15:13:37,086 INFO L226 Difference]: Without dead ends: 18 [2024-10-15 15:13:37,090 INFO L431 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-10-15 15:13:37,096 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:37,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 52 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:13:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-15 15:13:37,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-15 15:13:37,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-15 15:13:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-10-15 15:13:37,134 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2024-10-15 15:13:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:37,134 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-10-15 15:13:37,135 INFO L472 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-10-15 15:13:37,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-10-15 15:13:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-15 15:13:37,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:37,136 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:37,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:13:37,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:37,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash -799337521, now seen corresponding path program 1 times [2024-10-15 15:13:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:37,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570615958] [2024-10-15 15:13:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:37,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:37,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:13:37,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:37,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570615958] [2024-10-15 15:13:37,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570615958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:37,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899172870] [2024-10-15 15:13:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:37,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:37,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:37,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:37,361 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 15:13:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:37,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-15 15:13:37,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-15 15:13:37,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:13:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-15 15:13:37,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899172870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:13:37,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:13:37,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-10-15 15:13:37,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869853665] [2024-10-15 15:13:37,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:13:37,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-15 15:13:37,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:37,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-15 15:13:37,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-15 15:13:37,666 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-15 15:13:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:37,710 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-10-15 15:13:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 15:13:37,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 19 [2024-10-15 15:13:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:37,711 INFO L225 Difference]: With dead ends: 25 [2024-10-15 15:13:37,711 INFO L226 Difference]: Without dead ends: 21 [2024-10-15 15:13:37,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-15 15:13:37,714 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:37,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 50 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:13:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-15 15:13:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-15 15:13:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-15 15:13:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-15 15:13:37,720 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2024-10-15 15:13:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:37,721 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-15 15:13:37,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-15 15:13:37,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-15 15:13:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-15 15:13:37,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:37,726 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:37,739 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 15:13:37,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:37,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:37,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:37,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1955994435, now seen corresponding path program 2 times [2024-10-15 15:13:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:37,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351140687] [2024-10-15 15:13:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:37,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:37,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:37,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:38,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:38,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-15 15:13:38,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:38,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351140687] [2024-10-15 15:13:38,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351140687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:38,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630734406] [2024-10-15 15:13:38,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:13:38,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:38,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:38,134 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:38,150 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 15:13:38,195 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:13:38,196 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:13:38,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-15 15:13:38,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-15 15:13:38,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:13:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-15 15:13:38,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630734406] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:13:38,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:13:38,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 14 [2024-10-15 15:13:38,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745522837] [2024-10-15 15:13:38,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:13:38,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-15 15:13:38,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:38,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-15 15:13:38,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-15 15:13:38,547 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-15 15:13:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:38,626 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-10-15 15:13:38,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-15 15:13:38,626 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 25 [2024-10-15 15:13:38,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:38,627 INFO L225 Difference]: With dead ends: 28 [2024-10-15 15:13:38,627 INFO L226 Difference]: Without dead ends: 24 [2024-10-15 15:13:38,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-10-15 15:13:38,630 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:38,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:13:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-15 15:13:38,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-15 15:13:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-15 15:13:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-10-15 15:13:38,636 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2024-10-15 15:13:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:38,636 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-10-15 15:13:38,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-15 15:13:38,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-10-15 15:13:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-15 15:13:38,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:38,638 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:38,653 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-15 15:13:38,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:38,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:38,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1072241521, now seen corresponding path program 3 times [2024-10-15 15:13:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:38,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702183738] [2024-10-15 15:13:38,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:38,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:38,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:38,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:38,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:39,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-15 15:13:39,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:39,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702183738] [2024-10-15 15:13:39,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702183738] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:39,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640975526] [2024-10-15 15:13:39,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 15:13:39,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:39,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:39,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:39,086 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 15:13:39,122 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-15 15:13:39,122 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:13:39,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-15 15:13:39,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 15:13:39,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:13:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-15 15:13:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640975526] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:13:39,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:13:39,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 16 [2024-10-15 15:13:39,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118993304] [2024-10-15 15:13:39,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:13:39,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-15 15:13:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:39,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 15:13:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-10-15 15:13:39,614 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-15 15:13:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:39,669 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-15 15:13:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-15 15:13:39,670 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), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) Word has length 31 [2024-10-15 15:13:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:39,671 INFO L225 Difference]: With dead ends: 31 [2024-10-15 15:13:39,671 INFO L226 Difference]: Without dead ends: 27 [2024-10-15 15:13:39,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-10-15 15:13:39,675 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:39,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 74 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:13:39,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-15 15:13:39,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-15 15:13:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-15 15:13:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-10-15 15:13:39,680 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2024-10-15 15:13:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:39,680 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-10-15 15:13:39,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2024-10-15 15:13:39,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-10-15 15:13:39,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-15 15:13:39,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:39,681 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:39,696 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 15:13:39,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:39,882 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:39,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash -790562051, now seen corresponding path program 4 times [2024-10-15 15:13:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:39,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782909005] [2024-10-15 15:13:39,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:39,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:39,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:40,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:40,117 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-15 15:13:40,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:40,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782909005] [2024-10-15 15:13:40,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782909005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:40,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216406479] [2024-10-15 15:13:40,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 15:13:40,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:40,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:40,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:40,121 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 15:13:40,158 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 15:13:40,158 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:13:40,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-15 15:13:40,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-15 15:13:40,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:13:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-15 15:13:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216406479] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:13:40,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:13:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 18 [2024-10-15 15:13:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914087798] [2024-10-15 15:13:40,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:13:40,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-15 15:13:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:40,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-15 15:13:40,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-15 15:13:40,906 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-15 15:13:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:41,000 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-10-15 15:13:41,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-15 15:13:41,001 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), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) Word has length 37 [2024-10-15 15:13:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:41,002 INFO L225 Difference]: With dead ends: 34 [2024-10-15 15:13:41,002 INFO L226 Difference]: Without dead ends: 30 [2024-10-15 15:13:41,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2024-10-15 15:13:41,003 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:41,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 90 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:13:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-15 15:13:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-15 15:13:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-15 15:13:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-15 15:13:41,008 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2024-10-15 15:13:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:41,009 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-15 15:13:41,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0625) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2024-10-15 15:13:41,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-15 15:13:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-10-15 15:13:41,010 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:41,010 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:41,024 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-15 15:13:41,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:41,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:41,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash 446137679, now seen corresponding path program 5 times [2024-10-15 15:13:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:41,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508443862] [2024-10-15 15:13:41,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:41,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:41,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:41,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:41,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:41,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-15 15:13:41,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:41,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508443862] [2024-10-15 15:13:41,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508443862] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:41,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117280750] [2024-10-15 15:13:41,441 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 15:13:41,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:41,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:41,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:41,443 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 15:13:41,487 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-10-15 15:13:41,488 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:13:41,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-15 15:13:41,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-15 15:13:41,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:13:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-15 15:13:42,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117280750] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:13:42,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:13:42,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 15] total 20 [2024-10-15 15:13:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349836787] [2024-10-15 15:13:42,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:13:42,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-15 15:13:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-15 15:13:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2024-10-15 15:13:42,500 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 20 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2024-10-15 15:13:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:42,595 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-10-15 15:13:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-15 15:13:42,595 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) Word has length 43 [2024-10-15 15:13:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:42,596 INFO L225 Difference]: With dead ends: 37 [2024-10-15 15:13:42,596 INFO L226 Difference]: Without dead ends: 33 [2024-10-15 15:13:42,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2024-10-15 15:13:42,597 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 66 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:42,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 86 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:13:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-15 15:13:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-15 15:13:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-15 15:13:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-10-15 15:13:42,606 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2024-10-15 15:13:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:42,606 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-10-15 15:13:42,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2024-10-15 15:13:42,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-10-15 15:13:42,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-15 15:13:42,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:42,608 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:42,625 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-15 15:13:42,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-15 15:13:42,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:42,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:42,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1764409661, now seen corresponding path program 6 times [2024-10-15 15:13:42,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:42,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684183139] [2024-10-15 15:13:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:42,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:42,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:42,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:43,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:43,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-15 15:13:43,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684183139] [2024-10-15 15:13:43,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684183139] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986332160] [2024-10-15 15:13:43,071 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-15 15:13:43,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:43,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:43,073 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:43,074 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 15:13:43,133 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-10-15 15:13:43,133 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:13:43,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-15 15:13:43,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-15 15:13:43,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:13:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-15 15:13:44,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986332160] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:13:44,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:13:44,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 22 [2024-10-15 15:13:44,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225301188] [2024-10-15 15:13:44,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:13:44,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-15 15:13:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:44,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-15 15:13:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-10-15 15:13:44,418 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 22 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2024-10-15 15:13:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:44,496 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-10-15 15:13:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-15 15:13:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) Word has length 49 [2024-10-15 15:13:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:44,501 INFO L225 Difference]: With dead ends: 40 [2024-10-15 15:13:44,501 INFO L226 Difference]: Without dead ends: 36 [2024-10-15 15:13:44,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2024-10-15 15:13:44,502 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 56 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:44,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 92 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:13:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-15 15:13:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-15 15:13:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-15 15:13:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-10-15 15:13:44,507 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2024-10-15 15:13:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:44,507 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-10-15 15:13:44,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2024-10-15 15:13:44,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:44,508 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-10-15 15:13:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-15 15:13:44,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:44,510 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:44,522 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-15 15:13:44,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:44,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1097922063, now seen corresponding path program 7 times [2024-10-15 15:13:44,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:44,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228471678] [2024-10-15 15:13:44,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:44,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:44,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:44,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:44,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:44,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:45,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:45,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-15 15:13:45,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:45,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228471678] [2024-10-15 15:13:45,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228471678] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:45,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336753081] [2024-10-15 15:13:45,041 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-15 15:13:45,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:45,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:45,043 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:45,043 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-15 15:13:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:45,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-15 15:13:45,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-15 15:13:45,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:13:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-15 15:13:46,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336753081] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:13:46,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:13:46,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 19] total 24 [2024-10-15 15:13:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576171671] [2024-10-15 15:13:46,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:13:46,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-15 15:13:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:46,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-15 15:13:46,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2024-10-15 15:13:46,726 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-15 15:13:46,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:46,828 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-10-15 15:13:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 15:13:46,829 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) Word has length 55 [2024-10-15 15:13:46,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:46,829 INFO L225 Difference]: With dead ends: 43 [2024-10-15 15:13:46,830 INFO L226 Difference]: Without dead ends: 39 [2024-10-15 15:13:46,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=293, Invalid=637, Unknown=0, NotChecked=0, Total=930 [2024-10-15 15:13:46,831 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 81 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:46,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 116 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:13:46,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-15 15:13:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-15 15:13:46,835 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), 4 states have call successors, (4), 3 states have call predecessors, (4), 10 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-15 15:13:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-10-15 15:13:46,835 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2024-10-15 15:13:46,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:46,836 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-10-15 15:13:46,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-15 15:13:46,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-10-15 15:13:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-15 15:13:46,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:46,842 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:46,856 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-15 15:13:47,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:47,045 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:47,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:47,045 INFO L85 PathProgramCache]: Analyzing trace with hash 401815421, now seen corresponding path program 8 times [2024-10-15 15:13:47,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:47,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423824307] [2024-10-15 15:13:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-10-15 15:13:47,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423824307] [2024-10-15 15:13:47,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423824307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612242286] [2024-10-15 15:13:47,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:13:47,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:47,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:47,465 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-15 15:13:47,549 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:13:47,550 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:13:47,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-15 15:13:47,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-15 15:13:47,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:13:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-15 15:13:49,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612242286] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:13:49,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:13:49,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 21] total 26 [2024-10-15 15:13:49,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937674524] [2024-10-15 15:13:49,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:13:49,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-15 15:13:49,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:49,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-15 15:13:49,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2024-10-15 15:13:49,661 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 26 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 26 states have internal predecessors, (49), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (27), 10 states have call predecessors, (27), 13 states have call successors, (27) [2024-10-15 15:13:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:49,769 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-10-15 15:13:49,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-15 15:13:49,770 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 26 states have internal predecessors, (49), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (27), 10 states have call predecessors, (27), 13 states have call successors, (27) Word has length 61 [2024-10-15 15:13:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:49,773 INFO L225 Difference]: With dead ends: 46 [2024-10-15 15:13:49,773 INFO L226 Difference]: Without dead ends: 42 [2024-10-15 15:13:49,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=355, Invalid=767, Unknown=0, NotChecked=0, Total=1122 [2024-10-15 15:13:49,774 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:49,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 121 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:13:49,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-15 15:13:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-15 15:13:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 11 states have return successors, (12), 11 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-15 15:13:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-10-15 15:13:49,780 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2024-10-15 15:13:49,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:49,780 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-10-15 15:13:49,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 26 states have internal predecessors, (49), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (27), 10 states have call predecessors, (27), 13 states have call successors, (27) [2024-10-15 15:13:49,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-10-15 15:13:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-15 15:13:49,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:49,781 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:49,794 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-15 15:13:49,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:49,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:49,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:49,983 INFO L85 PathProgramCache]: Analyzing trace with hash -281594161, now seen corresponding path program 9 times [2024-10-15 15:13:49,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:49,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775947173] [2024-10-15 15:13:49,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-10-15 15:13:50,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775947173] [2024-10-15 15:13:50,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775947173] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472821305] [2024-10-15 15:13:50,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 15:13:50,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:50,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:50,482 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:50,483 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-15 15:13:50,612 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-10-15 15:13:50,613 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:13:50,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-15 15:13:50,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-10-15 15:13:50,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:13:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-15 15:13:53,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472821305] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:13:53,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:13:53,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 23] total 27 [2024-10-15 15:13:53,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575472031] [2024-10-15 15:13:53,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:13:53,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-15 15:13:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:53,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-15 15:13:53,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2024-10-15 15:13:53,453 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 13 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) [2024-10-15 15:13:53,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:53,565 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-10-15 15:13:53,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-15 15:13:53,566 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 13 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) Word has length 67 [2024-10-15 15:13:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:53,567 INFO L225 Difference]: With dead ends: 49 [2024-10-15 15:13:53,567 INFO L226 Difference]: Without dead ends: 45 [2024-10-15 15:13:53,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 132 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=420, Invalid=840, Unknown=0, NotChecked=0, Total=1260 [2024-10-15 15:13:53,569 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:53,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 136 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:13:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-15 15:13:53,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-15 15:13:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 12 states have return successors, (13), 12 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-15 15:13:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-10-15 15:13:53,576 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2024-10-15 15:13:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:53,576 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-10-15 15:13:53,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 27 states have internal predecessors, (52), 13 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) [2024-10-15 15:13:53,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-10-15 15:13:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-15 15:13:53,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:53,577 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:53,593 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-15 15:13:53,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-15 15:13:53,782 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:53,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash 132537789, now seen corresponding path program 10 times [2024-10-15 15:13:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:53,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244666315] [2024-10-15 15:13:53,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:53,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:53,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:54,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:54,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:54,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:54,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:54,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 10 proven. 155 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-10-15 15:13:54,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:54,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244666315] [2024-10-15 15:13:54,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244666315] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:54,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258169437] [2024-10-15 15:13:54,478 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 15:13:54,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:54,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:54,480 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:54,481 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-15 15:13:54,660 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 15:13:54,661 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:13:54,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-15 15:13:54,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-15 15:13:54,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:13:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-10-15 15:13:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258169437] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:13:55,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:13:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 27 [2024-10-15 15:13:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862479152] [2024-10-15 15:13:55,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:13:55,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-15 15:13:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-15 15:13:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2024-10-15 15:13:55,126 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 12 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-15 15:13:55,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:55,555 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2024-10-15 15:13:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-15 15:13:55,556 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 12 states have call predecessors, (13), 1 states have call successors, (13) Word has length 73 [2024-10-15 15:13:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:55,557 INFO L225 Difference]: With dead ends: 52 [2024-10-15 15:13:55,557 INFO L226 Difference]: Without dead ends: 48 [2024-10-15 15:13:55,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=2030, Unknown=0, NotChecked=0, Total=2162 [2024-10-15 15:13:55,558 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:55,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 452 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:13:55,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-15 15:13:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-15 15:13:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 13 states have return successors, (14), 13 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-15 15:13:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-10-15 15:13:55,567 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2024-10-15 15:13:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:55,568 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-10-15 15:13:55,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 12 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-15 15:13:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:55,568 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-10-15 15:13:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-15 15:13:55,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:13:55,570 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:13:55,582 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-15 15:13:55,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-15 15:13:55,770 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:13:55,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2004764559, now seen corresponding path program 11 times [2024-10-15 15:13:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:13:55,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949540982] [2024-10-15 15:13:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:13:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:13:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:55,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:13:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:13:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:13:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:13:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 165 proven. 33 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-15 15:13:56,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:13:56,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949540982] [2024-10-15 15:13:56,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949540982] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:13:56,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501651070] [2024-10-15 15:13:56,385 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-15 15:13:56,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:56,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:13:56,386 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 15:13:56,388 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-15 15:13:56,553 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-10-15 15:13:56,553 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:13:56,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-15 15:13:56,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:13:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-10-15 15:13:56,650 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:13:56,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501651070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:13:56,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 15:13:56,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [17] total 19 [2024-10-15 15:13:56,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813130755] [2024-10-15 15:13:56,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:13:56,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-15 15:13:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:13:56,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-15 15:13:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-10-15 15:13:56,652 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-15 15:13:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:13:56,806 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-10-15 15:13:56,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 15:13:56,807 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) Word has length 79 [2024-10-15 15:13:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:13:56,807 INFO L225 Difference]: With dead ends: 48 [2024-10-15 15:13:56,807 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 15:13:56,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=600, Unknown=0, NotChecked=0, Total=870 [2024-10-15 15:13:56,809 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:13:56,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 113 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:13:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 15:13:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 15:13:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-15 15:13:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 15:13:56,810 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2024-10-15 15:13:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:13:56,810 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 15:13:56,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 16 states have internal predecessors, (31), 3 states have call successors, (4), 1 states have call predecessors, (4), 13 states have return successors, (13), 13 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-15 15:13:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:13:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 15:13:56,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 15:13:56,813 INFO L782 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 15:13:56,830 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-15 15:13:57,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:13:57,021 INFO L407 BasicCegarLoop]: Path program histogram: [11, 1] [2024-10-15 15:13:57,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 15:13:57,611 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 15:13:57,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:13:57 BoogieIcfgContainer [2024-10-15 15:13:57,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 15:13:57,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 15:13:57,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 15:13:57,634 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 15:13:57,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:13:36" (3/4) ... [2024-10-15 15:13:57,636 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 15:13:57,685 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 15:13:57,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 15:13:57,686 INFO L158 Benchmark]: Toolchain (without parser) took 21699.05ms. Allocated memory was 165.7MB in the beginning and 352.3MB in the end (delta: 186.6MB). Free memory was 96.2MB in the beginning and 198.5MB in the end (delta: -102.4MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2024-10-15 15:13:57,686 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:13:57,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.10ms. Allocated memory is still 165.7MB. Free memory was 95.9MB in the beginning and 84.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 15:13:57,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.27ms. Allocated memory is still 165.7MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:13:57,687 INFO L158 Benchmark]: Boogie Preprocessor took 31.44ms. Allocated memory is still 165.7MB. Free memory was 83.3MB in the beginning and 81.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:13:57,688 INFO L158 Benchmark]: RCFGBuilder took 285.50ms. Allocated memory is still 165.7MB. Free memory was 81.7MB in the beginning and 69.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 15:13:57,688 INFO L158 Benchmark]: TraceAbstraction took 21071.49ms. Allocated memory was 165.7MB in the beginning and 352.3MB in the end (delta: 186.6MB). Free memory was 69.4MB in the beginning and 200.6MB in the end (delta: -131.2MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. [2024-10-15 15:13:57,689 INFO L158 Benchmark]: Witness Printer took 51.87ms. Allocated memory is still 352.3MB. Free memory was 200.6MB in the beginning and 198.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:13:57,690 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.15ms. Allocated memory is still 121.6MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.10ms. Allocated memory is still 165.7MB. Free memory was 95.9MB in the beginning and 84.3MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.27ms. Allocated memory is still 165.7MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.44ms. Allocated memory is still 165.7MB. Free memory was 83.3MB in the beginning and 81.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 285.50ms. Allocated memory is still 165.7MB. Free memory was 81.7MB in the beginning and 69.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21071.49ms. Allocated memory was 165.7MB in the beginning and 352.3MB in the end (delta: 186.6MB). Free memory was 69.4MB in the beginning and 200.6MB in the end (delta: -131.2MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. * Witness Printer took 51.87ms. Allocated memory is still 352.3MB. Free memory was 200.6MB in the beginning and 198.5MB 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: 15]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 12, TraceHistogramMax: 12, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 404 mSDsluCounter, 1462 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1278 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1270 IncrementalHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 184 mSDtfsCounter, 1270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1369 GetRequests, 1032 SyntacticMatches, 55 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=11, InterpolantAutomatonStates: 137, 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, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 1091 NumberOfCodeBlocks, 1085 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 1518 ConstructedInterpolants, 0 QuantifiedInterpolants, 3978 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1424 ConjunctsInSsa, 199 ConjunctsInUnsatCore, 33 InterpolantComputations, 2 PerfectInterpolantSequences, 2200/4378 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: 6]: Procedure Contract for id Derived contract for procedure id. Ensures: (((((((((((((3 == \result) && (x == 3)) || ((x == 6) && (6 == \result))) || ((9 == \result) && (x == 9))) || ((2 == \result) && (x == 2))) || ((10 == \result) && (x == 10))) || ((5 == \result) && (5 == x))) || ((8 == \result) && (x == 8))) || ((7 == \result) && (7 == x))) || (10 < x)) || ((\result == 1) && (x == 1))) || ((x == 4) && (4 == \result))) || ((\result == 0) && (x == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-15 15:13:57,716 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