./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-simple/nested_3.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:39:30,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:39:30,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:39:30,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:39:30,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:39:30,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:39:30,641 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:39:30,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:39:30,642 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:39:30,645 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:39:30,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:39:30,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:39:30,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:39:30,646 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:39:30,646 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:39:30,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:39:30,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:39:30,646 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:39:30,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:39:30,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:39:30,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:39:30,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:39:30,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:39:30,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:39:30,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:39:30,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:39:30,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:39:30,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:39:30,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:39:30,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:39:30,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:39:30,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:39:30,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:39:30,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:39:30,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:39:30,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:39:30,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:39:30,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:39:30,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:39:30,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:39:30,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:39:30,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:39:30,654 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 15:39:30,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:39:30,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:39:30,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:39:30,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:39:30,908 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:39:30,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-simple/nested_3.c [2024-09-12 15:39:32,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:39:32,223 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:39:32,224 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_3.c [2024-09-12 15:39:32,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/85dee4fba/f063d51086204e7199fcb9b8b29d3930/FLAG21ff62220 [2024-09-12 15:39:32,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/85dee4fba/f063d51086204e7199fcb9b8b29d3930 [2024-09-12 15:39:32,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:39:32,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:39:32,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:39:32,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:39:32,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:39:32,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8ef938 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32, skipping insertion in model container [2024-09-12 15:39:32,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:39:32,792 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_3.c[784,797] [2024-09-12 15:39:32,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:39:32,810 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:39:32,822 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-simple/nested_3.c[784,797] [2024-09-12 15:39:32,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:39:32,834 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:39:32,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32 WrapperNode [2024-09-12 15:39:32,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:39:32,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:39:32,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:39:32,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:39:32,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,866 INFO L138 Inliner]: procedures = 10, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:39:32,867 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:39:32,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:39:32,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:39:32,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:39:32,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,884 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-12 15:39:32,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:39:32,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:39:32,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:39:32,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:39:32,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (1/1) ... [2024-09-12 15:39:32,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:39:32,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:32,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 15:39:32,927 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 15:39:32,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:39:32,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:39:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:39:32,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:39:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:39:32,961 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:39:32,961 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:39:32,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:39:33,010 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:39:33,012 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:39:33,116 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-12 15:39:33,116 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:39:33,142 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:39:33,142 INFO L318 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-12 15:39:33,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:39:33 BoogieIcfgContainer [2024-09-12 15:39:33,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:39:33,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:39:33,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:39:33,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:39:33,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:39:32" (1/3) ... [2024-09-12 15:39:33,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f8b4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:39:33, skipping insertion in model container [2024-09-12 15:39:33,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:39:32" (2/3) ... [2024-09-12 15:39:33,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f8b4e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:39:33, skipping insertion in model container [2024-09-12 15:39:33,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:39:33" (3/3) ... [2024-09-12 15:39:33,151 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_3.c [2024-09-12 15:39:33,162 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:39:33,162 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:39:33,207 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:39:33,212 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d61ccc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:39:33,212 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:39:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 15:39:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 15:39:33,220 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:33,221 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:33,221 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:33,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1012239947, now seen corresponding path program 1 times [2024-09-12 15:39:33,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:33,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219524451] [2024-09-12 15:39:33,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:33,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:33,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:33,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219524451] [2024-09-12 15:39:33,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219524451] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:39:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:39:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 15:39:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774128779] [2024-09-12 15:39:33,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:39:33,348 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 15:39:33,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:33,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 15:39:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:39:33,367 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:33,387 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2024-09-12 15:39:33,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 15:39:33,389 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-12 15:39:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:33,393 INFO L225 Difference]: With dead ends: 29 [2024-09-12 15:39:33,394 INFO L226 Difference]: Without dead ends: 13 [2024-09-12 15:39:33,396 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:39:33,398 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:33,401 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-12 15:39:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-12 15:39:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-09-12 15:39:33,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2024-09-12 15:39:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:33,430 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-09-12 15:39:33,430 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-09-12 15:39:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 15:39:33,430 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:33,431 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:33,431 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:39:33,431 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:33,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1012211117, now seen corresponding path program 1 times [2024-09-12 15:39:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:33,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868858731] [2024-09-12 15:39:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:33,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:33,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:33,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868858731] [2024-09-12 15:39:33,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868858731] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:39:33,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:39:33,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:39:33,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372374184] [2024-09-12 15:39:33,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:39:33,498 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:39:33,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:33,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:39:33,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:33,499 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:33,517 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2024-09-12 15:39:33,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:39:33,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-12 15:39:33,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:33,518 INFO L225 Difference]: With dead ends: 21 [2024-09-12 15:39:33,518 INFO L226 Difference]: Without dead ends: 18 [2024-09-12 15:39:33,519 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:33,520 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:33,520 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-12 15:39:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2024-09-12 15:39:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-09-12 15:39:33,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2024-09-12 15:39:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:33,524 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-09-12 15:39:33,524 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-09-12 15:39:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 15:39:33,525 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:33,525 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:33,525 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 15:39:33,525 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:33,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash -150948438, now seen corresponding path program 1 times [2024-09-12 15:39:33,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:33,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919369944] [2024-09-12 15:39:33,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:33,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:33,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:33,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919369944] [2024-09-12 15:39:33,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919369944] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:39:33,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:39:33,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:39:33,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977492541] [2024-09-12 15:39:33,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:39:33,570 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:39:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:33,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:39:33,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:33,571 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:33,585 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2024-09-12 15:39:33,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:39:33,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 15:39:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:33,586 INFO L225 Difference]: With dead ends: 25 [2024-09-12 15:39:33,586 INFO L226 Difference]: Without dead ends: 17 [2024-09-12 15:39:33,586 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:33,587 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:33,588 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-12 15:39:33,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2024-09-12 15:39:33,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-09-12 15:39:33,591 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-09-12 15:39:33,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:33,591 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-09-12 15:39:33,591 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:33,592 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-09-12 15:39:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 15:39:33,592 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:33,592 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:33,592 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 15:39:33,593 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:33,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2014245097, now seen corresponding path program 1 times [2024-09-12 15:39:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:33,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454767329] [2024-09-12 15:39:33,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:33,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:33,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:33,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454767329] [2024-09-12 15:39:33,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454767329] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:39:33,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:39:33,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 15:39:33,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464569236] [2024-09-12 15:39:33,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:39:33,642 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 15:39:33,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:33,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 15:39:33,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:33,645 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:33,665 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2024-09-12 15:39:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 15:39:33,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 15:39:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:33,666 INFO L225 Difference]: With dead ends: 25 [2024-09-12 15:39:33,666 INFO L226 Difference]: Without dead ends: 16 [2024-09-12 15:39:33,667 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 15:39:33,667 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:33,668 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:33,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-12 15:39:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-12 15:39:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-12 15:39:33,671 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2024-09-12 15:39:33,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:33,671 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-12 15:39:33,671 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-12 15:39:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 15:39:33,672 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:33,672 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:33,672 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 15:39:33,673 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:33,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1860063267, now seen corresponding path program 1 times [2024-09-12 15:39:33,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:33,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000375559] [2024-09-12 15:39:33,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:33,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:33,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:33,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000375559] [2024-09-12 15:39:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000375559] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:33,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342822240] [2024-09-12 15:39:33,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:33,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:33,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:33,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:39:33,724 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 15:39:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:33,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 15:39:33,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:33,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:33,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342822240] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:33,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:33,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 15:39:33,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699810859] [2024-09-12 15:39:33,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:33,853 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:39:33,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:33,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:39:33,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:39:33,854 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:33,887 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-09-12 15:39:33,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:39:33,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-12 15:39:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:33,889 INFO L225 Difference]: With dead ends: 29 [2024-09-12 15:39:33,889 INFO L226 Difference]: Without dead ends: 19 [2024-09-12 15:39:33,890 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:39:33,890 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:33,891 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-12 15:39:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-12 15:39:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-09-12 15:39:33,897 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2024-09-12 15:39:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:33,898 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-09-12 15:39:33,898 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:33,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-09-12 15:39:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 15:39:33,899 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:33,899 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:33,910 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 15:39:34,099 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:34,099 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:34,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2042556951, now seen corresponding path program 2 times [2024-09-12 15:39:34,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:34,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68289192] [2024-09-12 15:39:34,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:34,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:34,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:34,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-12 15:39:34,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:34,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68289192] [2024-09-12 15:39:34,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68289192] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:34,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894707639] [2024-09-12 15:39:34,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 15:39:34,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:34,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:34,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:39:34,190 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 15:39:34,219 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 15:39:34,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:39:34,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 15:39:34,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:34,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:34,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 15:39:34,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894707639] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:34,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:34,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 10 [2024-09-12 15:39:34,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525048127] [2024-09-12 15:39:34,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:34,328 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 15:39:34,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:34,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 15:39:34,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-09-12 15:39:34,333 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:34,477 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-09-12 15:39:34,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 15:39:34,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 15:39:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:34,478 INFO L225 Difference]: With dead ends: 51 [2024-09-12 15:39:34,478 INFO L226 Difference]: Without dead ends: 38 [2024-09-12 15:39:34,479 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-09-12 15:39:34,480 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:34,480 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 49 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-12 15:39:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-09-12 15:39:34,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-09-12 15:39:34,487 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2024-09-12 15:39:34,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:34,487 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-09-12 15:39:34,488 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:34,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-09-12 15:39:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 15:39:34,490 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:34,490 INFO L216 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:34,502 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 15:39:34,690 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 15:39:34,691 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:34,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:34,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1056908150, now seen corresponding path program 3 times [2024-09-12 15:39:34,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:34,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227099958] [2024-09-12 15:39:34,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:34,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:34,776 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-12 15:39:34,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:34,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227099958] [2024-09-12 15:39:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227099958] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:34,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963000036] [2024-09-12 15:39:34,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 15:39:34,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:34,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:34,786 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:39:34,787 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 15:39:34,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-12 15:39:34,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:39:34,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-12 15:39:34,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-12 15:39:34,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-09-12 15:39:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963000036] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:34,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-12 15:39:34,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290855061] [2024-09-12 15:39:34,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:34,923 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 15:39:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:34,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 15:39:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:39:34,924 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:34,959 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2024-09-12 15:39:34,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:39:34,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-09-12 15:39:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:34,961 INFO L225 Difference]: With dead ends: 96 [2024-09-12 15:39:34,961 INFO L226 Difference]: Without dead ends: 93 [2024-09-12 15:39:34,961 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-12 15:39:34,962 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:34,962 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-12 15:39:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-09-12 15:39:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.146067415730337) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2024-09-12 15:39:34,983 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 29 [2024-09-12 15:39:34,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:34,985 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-09-12 15:39:34,985 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:34,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2024-09-12 15:39:34,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-09-12 15:39:34,989 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:34,989 INFO L216 NwaCegarLoop]: trace histogram [48, 8, 8, 8, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:35,002 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 15:39:35,189 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-12 15:39:35,190 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:35,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:35,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1817816557, now seen corresponding path program 4 times [2024-09-12 15:39:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:35,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782344332] [2024-09-12 15:39:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:35,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-09-12 15:39:35,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:35,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782344332] [2024-09-12 15:39:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782344332] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:35,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829734018] [2024-09-12 15:39:35,349 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 15:39:35,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:35,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:35,351 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:39:35,352 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 15:39:35,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 15:39:35,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:39:35,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 15:39:35,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-09-12 15:39:35,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 631 proven. 53 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2024-09-12 15:39:35,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829734018] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:35,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:35,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-12 15:39:35,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933730024] [2024-09-12 15:39:35,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:35,502 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 15:39:35,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:35,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 15:39:35,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:39:35,505 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:35,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:35,552 INFO L93 Difference]: Finished difference Result 305 states and 358 transitions. [2024-09-12 15:39:35,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:39:35,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-09-12 15:39:35,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:35,554 INFO L225 Difference]: With dead ends: 305 [2024-09-12 15:39:35,555 INFO L226 Difference]: Without dead ends: 237 [2024-09-12 15:39:35,555 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:39:35,556 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:35,556 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:35,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-09-12 15:39:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-09-12 15:39:35,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.1244635193133048) internal successors, (262), 233 states have internal predecessors, (262), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2024-09-12 15:39:35,596 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 92 [2024-09-12 15:39:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:35,596 INFO L474 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2024-09-12 15:39:35,596 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:35,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2024-09-12 15:39:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-09-12 15:39:35,604 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:35,604 INFO L216 NwaCegarLoop]: trace histogram [144, 24, 24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:35,616 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 15:39:35,808 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:35,808 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:35,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:35,809 INFO L85 PathProgramCache]: Analyzing trace with hash 2114622189, now seen corresponding path program 5 times [2024-09-12 15:39:35,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:35,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616260859] [2024-09-12 15:39:35,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:36,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-09-12 15:39:36,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616260859] [2024-09-12 15:39:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616260859] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:36,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116550827] [2024-09-12 15:39:36,135 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 15:39:36,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:36,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:39:36,137 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 15:39:36,284 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 79 check-sat command(s) [2024-09-12 15:39:36,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:39:36,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 15:39:36,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-09-12 15:39:36,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:36,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14698 backedges. 0 proven. 11110 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2024-09-12 15:39:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116550827] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:36,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:36,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-09-12 15:39:36,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938514475] [2024-09-12 15:39:36,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:36,807 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 15:39:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:36,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 15:39:36,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:39:36,808 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:36,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:36,868 INFO L93 Difference]: Finished difference Result 354 states and 397 transitions. [2024-09-12 15:39:36,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:39:36,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 236 [2024-09-12 15:39:36,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:36,870 INFO L225 Difference]: With dead ends: 354 [2024-09-12 15:39:36,870 INFO L226 Difference]: Without dead ends: 351 [2024-09-12 15:39:36,871 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 469 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-12 15:39:36,871 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:36,871 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:39:36,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-09-12 15:39:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2024-09-12 15:39:36,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 347 states have (on average 1.1239193083573487) internal successors, (390), 347 states have internal predecessors, (390), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 393 transitions. [2024-09-12 15:39:36,908 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 393 transitions. Word has length 236 [2024-09-12 15:39:36,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:36,908 INFO L474 AbstractCegarLoop]: Abstraction has 351 states and 393 transitions. [2024-09-12 15:39:36,908 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:36,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 393 transitions. [2024-09-12 15:39:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-09-12 15:39:36,915 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:39:36,915 INFO L216 NwaCegarLoop]: trace histogram [216, 36, 36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:39:36,932 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 15:39:37,116 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:37,116 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:39:37,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:37,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1900573069, now seen corresponding path program 6 times [2024-09-12 15:39:37,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:39:37,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783544262] [2024-09-12 15:39:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:39:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:39:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:38,133 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:39:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:39:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 0 proven. 28563 refuted. 0 times theorem prover too weak. 4590 trivial. 0 not checked. [2024-09-12 15:39:38,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:39:38,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783544262] [2024-09-12 15:39:38,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783544262] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:39:38,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563397471] [2024-09-12 15:39:38,142 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 15:39:38,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:39:38,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:39:38,144 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:39:38,146 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-12 15:39:38,272 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 59 check-sat command(s) [2024-09-12 15:39:38,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:39:38,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-12 15:39:38,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:39:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 9512 proven. 21 refuted. 0 times theorem prover too weak. 23620 trivial. 0 not checked. [2024-09-12 15:39:38,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:39:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 33153 backedges. 9256 proven. 277 refuted. 0 times theorem prover too weak. 23620 trivial. 0 not checked. [2024-09-12 15:39:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563397471] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:39:38,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:39:38,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 14, 14] total 41 [2024-09-12 15:39:38,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150512185] [2024-09-12 15:39:38,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:39:38,910 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-12 15:39:38,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:39:38,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-12 15:39:38,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=1303, Unknown=0, NotChecked=0, Total=1640 [2024-09-12 15:39:38,911 INFO L87 Difference]: Start difference. First operand 351 states and 393 transitions. Second operand has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 41 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:42,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:39:42,363 INFO L93 Difference]: Finished difference Result 687 states and 772 transitions. [2024-09-12 15:39:42,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2024-09-12 15:39:42,363 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 41 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 350 [2024-09-12 15:39:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:39:42,365 INFO L225 Difference]: With dead ends: 687 [2024-09-12 15:39:42,365 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 15:39:42,384 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 686 SyntacticMatches, 2 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34264 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=9112, Invalid=78208, Unknown=0, NotChecked=0, Total=87320 [2024-09-12 15:39:42,384 INFO L434 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 15:39:42,385 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 15:39:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 15:39:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 15:39:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 15:39:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 15:39:42,386 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 350 [2024-09-12 15:39:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:39:42,386 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 15:39:42,386 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 41 states have internal predecessors, (105), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 15:39:42,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:39:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 15:39:42,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 15:39:42,389 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 15:39:42,402 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-12 15:39:42,593 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-12 15:39:42,596 INFO L408 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2024-09-12 15:39:42,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 15:39:45,759 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 15:39:45,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 03:39:45 BoogieIcfgContainer [2024-09-12 15:39:45,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 15:39:45,771 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 15:39:45,771 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 15:39:45,771 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 15:39:45,772 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:39:33" (3/4) ... [2024-09-12 15:39:45,773 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 15:39:45,775 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 15:39:45,776 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 15:39:45,778 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-09-12 15:39:45,779 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-09-12 15:39:45,779 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 15:39:45,779 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 15:39:45,844 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 15:39:45,844 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 15:39:45,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 15:39:45,845 INFO L158 Benchmark]: Toolchain (without parser) took 13186.48ms. Allocated memory was 90.2MB in the beginning and 543.2MB in the end (delta: 453.0MB). Free memory was 53.8MB in the beginning and 237.0MB in the end (delta: -183.2MB). Peak memory consumption was 270.2MB. Max. memory is 16.1GB. [2024-09-12 15:39:45,845 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 54.5MB. Free memory was 33.3MB in the beginning and 33.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:39:45,846 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.60ms. Allocated memory is still 90.2MB. Free memory was 53.5MB in the beginning and 69.9MB in the end (delta: -16.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-09-12 15:39:45,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.72ms. Allocated memory is still 90.2MB. Free memory was 69.9MB in the beginning and 69.2MB in the end (delta: 719.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 15:39:45,846 INFO L158 Benchmark]: Boogie Preprocessor took 26.54ms. Allocated memory is still 90.2MB. Free memory was 68.8MB in the beginning and 67.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 15:39:45,846 INFO L158 Benchmark]: RCFGBuilder took 247.89ms. Allocated memory is still 90.2MB. Free memory was 67.1MB in the beginning and 55.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 15:39:45,847 INFO L158 Benchmark]: TraceAbstraction took 12626.87ms. Allocated memory was 90.2MB in the beginning and 543.2MB in the end (delta: 453.0MB). Free memory was 55.3MB in the beginning and 241.2MB in the end (delta: -185.9MB). Peak memory consumption was 282.4MB. Max. memory is 16.1GB. [2024-09-12 15:39:45,847 INFO L158 Benchmark]: Witness Printer took 72.90ms. Allocated memory is still 543.2MB. Free memory was 241.2MB in the beginning and 237.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 15:39:45,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 54.5MB. Free memory was 33.3MB in the beginning and 33.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.60ms. Allocated memory is still 90.2MB. Free memory was 53.5MB in the beginning and 69.9MB in the end (delta: -16.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 15.72ms. Allocated memory is still 90.2MB. Free memory was 69.9MB in the beginning and 69.2MB in the end (delta: 719.2kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.54ms. Allocated memory is still 90.2MB. Free memory was 68.8MB in the beginning and 67.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 247.89ms. Allocated memory is still 90.2MB. Free memory was 67.1MB in the beginning and 55.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12626.87ms. Allocated memory was 90.2MB in the beginning and 543.2MB in the end (delta: 453.0MB). Free memory was 55.3MB in the beginning and 241.2MB in the end (delta: -185.9MB). Peak memory consumption was 282.4MB. Max. memory is 16.1GB. * Witness Printer took 72.90ms. Allocated memory is still 543.2MB. Free memory was 241.2MB in the beginning and 237.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 10, TraceHistogramMax: 216, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 474 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 112 mSDtfsCounter, 474 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 1474 SyntacticMatches, 10 SemanticMatches, 341 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34391 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=351occurred in iteration=9, InterpolantAutomatonStates: 329, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1521 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 2239 ConstructedInterpolants, 0 QuantifiedInterpolants, 5413 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1580 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 86462/148839 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((c == 6) && (b <= 6)) && (a <= 5)) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((b == 6) && (c == 6)) && (a <= 6)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((((b <= 5) && (a <= 5)) && (c == 1)) || (((b <= 5) && (5 == c)) && (a <= 5))) || (((c == 6) && (b <= 5)) && (a <= 5))) || (((b <= 5) && (a <= 5)) && (c == 3))) || (((b <= 5) && (c == 0)) && (a <= 5))) || (((b <= 5) && (c == 2)) && (a <= 5))) || (((b <= 5) && (c == 4)) && (a <= 5))) RESULT: Ultimate proved your program to be correct! [2024-09-12 15:39:45,871 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE